Title
A note on the three color problem
Abstract
It is shown that a planar graph withouti-circuits, 4 ≤i ≤ 9, is 3-colorable. This result strengthens the result obtained by H.L. Abbott and B. Zhou.
Year
DOI
Venue
1995
10.1007/BF01787424
Graphs and Combinatorics
Keywords
Field
DocType
planar graph
Topology,Outerplanar graph,Combinatorics,Planar straight-line graph,Cubic graph,Friendship graph,Apex graph,Graph minor,Mathematics,Voltage graph,Planar graph
Journal
Volume
Issue
ISSN
11
1
1435-5914
Citations 
PageRank 
References 
28
3.21
1
Authors
2
Name
Order
Citations
PageRank
Daniel P. Sanders147145.56
Yue Zhao2283.21