Edge colorings of planar graphs without 5-cycles with two chords

DOI10.1016/j.tcs.2013.07.027zbMath1370.05075OpenAlexW1993496482MaRDI QIDQ391789

Ling Xue, Jian Liang Wu

Publication date: 13 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.027

zbMATH Keywords

cycleedge coloringplanar graphclass 1

Mathematics Subject Classification ID

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

Related Items

A survey on the cyclic coloring and its relaxations ⋮ On edge colorings of 1-planar graphs without 5-cycles with two chords ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Graph edge coloring: a survey ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Edge colorings of graphs embeddable in a surface of low genus
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• Edge-coloring critical graphs with high degree
• Planar graphs of maximum degree seven are Class I
• A note on graphs of class I
• A sufficient condition for a planar graph to be class I
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• Every planar graph with maximum degree 7 is of class 1