86 search results - page 2 / 18 » On the Maximum Degree of a Random Planar Graph |
IPL
2010
14 years 8 months ago
2010
RSA
2006
14 years 9 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), ...
92
Voted
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
ALGORITHMICA
2008
14 years 9 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...
JCT
2006
14 years 9 months ago
2006
: We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3 8 n. This was suggested and later conjectured b...