Sciweavers

3 search results - page 1 / 1
» On incidence coloring for some cubic graphs
Sort
View
90
Voted
DM
2002
84views more  DM 2002»
14 years 10 months ago
On incidence coloring for some cubic graphs
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...
Wai Chee Shiu, Peter Che Bor Lam, Dong-Ling Chen
67
Voted
DM
1998
69views more  DM 1998»
14 years 9 months ago
A study of the total chromatic number of equibipartite graphs
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-C...
91
Voted
GC
2010
Springer
14 years 8 months ago
The b-Chromatic Number of Cubic Graphs
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
Marko Jakovac, Sandi Klavzar