Search Sciweavers | Sciweavers

100 search results - page 1 / 20

» Coloring powers of planar graphs

click to vote

SODA
2000
ACM

121views Algorithms» more SODA 2000»

Coloring powers of planar graphs

14 years 10 months ago

Download math.gmu.edu

We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...

Geir Agnarsson, Magnús M. Halldórsso...

claim paper

Read More »

click to vote

DM
2010

131views more DM 2010»

Planar graphs without adjacent cycles of length at most seven are 3-colorable

14 years 9 months ago

Download hal.archives-ouvertes.fr

We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...

Oleg V. Borodin, Mickaël Montassier, Andr&eac...

claim paper

Read More »

click to vote

STOC
2007
ACM

110views Algorithms» more STOC 2007»

Randomly coloring planar graphs with fewer colors than the maximum degree

15 years 9 months ago

Download www.cc.gatech.edu

Thomas P. Hayes, Juan Carlos Vera, Eric Vigoda

claim paper

Read More »

click to vote

ALGORITHMICA
2008

142views more ALGORITHMICA 2008»

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

14 years 9 months ago

Download cs.nyu.edu

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...

Richard Cole, Lukasz Kowalik

claim paper

Read More »

click to vote

GC
2002
Springer

108views Applied Computing» more GC 2002»

n-Tuple Coloring of Planar Graphs with Large Odd Girth

14 years 9 months ago