Title of article
Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided
Author/Authors
Hutchinson، نويسنده , , J.P.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
17
From page
139
To page
155
Abstract
Every graph embedded on a surface of positive genus with every face bounded by an even number of edges can be 3-colored provided all noncontractible cycles in the graph are sufficiently long. The bound of three colors is the smallest possible for this type of result.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1995
Journal title
Journal of Combinatorial Theory Series B
Record number
1526050
Link To Document