Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

GC
2002
Springer

favoriteEmaildiscussreport

108views Applied Computing» more GC 2002»

n-Tuple Coloring of Planar Graphs with Large Odd Girth

13 years 4 months ago

n-Tuple Coloring of Planar Graphs with Large Odd Girth

Download www.unf.edu

The main result of the papzer is that any planar graph with odd girth at least 10k

William Klostermeyer, Cun-Quan Zhang

Real-time Traffic

Applied Computing | GC 2002 | Kneser Graph | Odd Girth | Planar Graphs |

claim paper

Related Content

» Coloring squares of planar graphs with girth six

» Locally identifying coloring of graphs

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2002
Where	GC
Authors	William Klostermeyer, Cun-Quan Zhang

Comments (0)