n-Tuple Coloring of Planar Graphs with Large Odd Girth

13 years 11 months ago

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

William Klostermeyer, Cun-Quan Zhang

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

claim paper

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

Comments (0)