Edge coloring of embedded graphs with large girth

DOI10.1007/s00373-002-0514-8zbMath1023.05050OpenAlexW2067817839MaRDI QIDQ1411115

Rong Luo, Xue-Chao Li

Publication date: 16 October 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-002-0514-8

zbMATH Keywords

surfaceEuler characteristicgirthedge chromatic number

Mathematics Subject Classification ID

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

Related Items (5)

Subcubic planar graphs of girth 7 are class I ⋮ Edge coloring of planar graphs which any two short cycles are adjacent at most once ⋮ Strong edge-colouring of sparse planar graphs ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles

This page was built for publication: Edge coloring of embedded graphs with large girth