Edge coloring of graphs embedded in a surface of nonnegative characteristic (Q2401779): Difference between revisions

Let \(G\) be a graph embeddable in a surface of nonnegative characteristic with maximum degree six. Let \(k \geq 3\) be an integer. A vertex \(v\) of a graph \(G\) is called a \(k\)-monster if \(v\) is contained in all cycles of length from 3 to \(k\). The following theorem is proved. If \(G\) is a graph of nonnegative characteristic with \(\Delta = 6\) and without 6-monster, then \(\chi^{\prime}(G) = 6\).