65 search results - page 1 / 13 » A decomposition for total-coloring graphs of maximum degree ... |
IPL
2010
13 years 3 months ago
2010
COLOGNETWENTE
2008
13 years 6 months ago
2008
DM
2008
13 years 4 months ago
2008
Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...
DM
2002
13 years 4 months ago
2002
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 ...
JDA
2008
13 years 4 months ago
2008
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...