Coloring edges of embedded graphs

DOI<197::AID-JGT5>3.0.CO;2-1 10.1002/1097-0118(200011)35:3<197::AID-JGT5>3.0.CO;2-1zbMath0966.05032OpenAlexW4240282864MaRDI QIDQ4521489

Yue Zhao, Daniel P. Sanders

Publication date: 20 August 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200011)35:3<197::aid-jgt5>3.0.co;2-1

zbMATH Keywords

surfaceembedded graphsedge coloringsclass oneVizing classes

Mathematics Subject Classification ID

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

Related Items

An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree ⋮ Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles

Cites Work

• Edge colorings of embedded graphs
• Edge colorings of graphs embeddable in a surface of low genus
• Regular Graphs of High Degree are 1-Factorizable