Edge colorings of graphs embeddable in a surface of low genus

DOI10.1016/S0012-365X(98)00050-8zbMath0956.05043MaRDI QIDQ1584389

Hugh Hind, Yue Zhao

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

surfacesgenuscoloringsdischarging method

Mathematics Subject Classification ID

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

Related Items (14)

Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5 ⋮ Edge coloring of planar graphs without adjacent 7-cycles ⋮ Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) ⋮ Edge colorings of planar graphs without 5-cycles with two chords ⋮ Coloring edges of graphs embedded in a surface of characteristic zero. ⋮ Edge coloring of graphs with small average degrees ⋮ Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ Edge colorings of planar graphs without 6-cycles with three chords ⋮ Coloring edges of embedded graphs ⋮ List-edge and list-total colorings of graphs embedded on hyperbolic surfaces ⋮ Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles ⋮ Upper bounds on the maximum degree of class two graphs on surfaces ⋮ Finding Δ(Σ) for a Surface Σ of Characteristic −4

Cites Work

• Unnamed Item
• Unnamed Item
• The four-colour theorem
• The chromatic class and the location of a graph on a closed surface
• Every Planar Map is Four Colorable

This page was built for publication: Edge colorings of graphs embeddable in a surface of low genus