Coloring edges of graphs embedded in a surface of characteristic zero.

DOI10.1016/S0095-8956(02)00008-4zbMath1068.05026MaRDI QIDQ1405117

Daniel P. Sanders, Yue Zhao

Publication date: 25 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

class oneclass two graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (15)

A note on the size of edge-chromatic 4-critical graphs ⋮ Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5 ⋮ Edge coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Class I graphs of nonnegative characteristic without special cycles ⋮ Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) ⋮ Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees ⋮ The average degree of edge chromatic critical graphs with maximum degree seven ⋮ Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) ⋮ A sufficient condition for a planar graph to be class I ⋮ An introduction to the discharging method via graph coloring ⋮ Some sufficient conditions for a planar graph of maximum degree six to be Class 1 ⋮ Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles ⋮ Upper bounds on the maximum degree of class two graphs on surfaces ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero ⋮ Finding Δ(Σ) for a Surface Σ of Characteristic −4

Cites Work

• Unnamed Item
• Edge colorings of graphs embeddable in a surface of low genus
• Planar graphs of maximum degree seven are Class I
• The chromatic class and the location of a graph on a closed surface

This page was built for publication: Coloring edges of graphs embedded in a surface of characteristic zero.