Edge coloring of planar graphs without adjacent 7-cycles

DOI10.1016/j.tcs.2018.05.006zbMath1394.05038OpenAlexW2802450256MaRDI QIDQ1643159

Wenwen Zhang, Jian Liang Wu

Publication date: 18 June 2018

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

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

zbMATH Keywords

cycleedge coloringplanar graphclass 1

Mathematics Subject Classification ID

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

Related Items (6)

Optimal \(r\)-dynamic coloring of sparse graphs ⋮ A survey on the cyclic coloring and its relaxations ⋮ 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 ⋮ The edge colorings of \(K_5\)-minor free graphs

Cites Work

• Edge colorings of graphs embeddable in a surface of low genus
• Edge-coloring critical graphs with high degree
• Planar graphs of maximum degree seven are Class I
• A note on graphs of class I
• Every planar graph with maximum degree 7 is of class 1
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge coloring of planar graphs without adjacent 7-cycles