37 search results - page 1 / 8 » Randomly coloring planar graphs with fewer colors than the m... |
STOC
2007
ACM
14 years 5 months ago
2007
ACM
RSA
2006
13 years 4 months ago
2006
We analyze Markov chains for generating a random k-coloring of a random graph Gn,d/n. When the average degree d is constant, a random graph has maximum degree (log n/ log log n), ...
ALGORITHMICA
2008
13 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...
IPL
2010
13 years 3 months ago
2010
EJC
2008
13 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. ...