18 search results - page 1 / 4 » Total coloring of planar graphs of maximum degree eight |
120
Voted
IPL
2010
15 years 3 months ago
2010
163
Voted
ALGORITHMICA
2008
15 years 5 months ago
2008
We show efficient algorithms for edge-coloring planar graphs. Our main result is a linear-time algorithm for coloring planar graphs with maximum degree with max{, 9} colors. Thus...
135
click to vote
EJC
2008
15 years 5 months ago
2008
Wang and Lih conjectured that for every g 5, there exists a number M(g) such that the square of a planar graph G of girth at least g and maximum degree M(g) is (+1)-colorable. ...