Edge colorings of planar graphs without 6-cycles with three chords

DOI10.1007/s40840-016-0376-5zbMath1457.05040OpenAlexW4235062582MaRDI QIDQ1746732

Wenwen Zhang, Jian Liang Wu

Publication date: 25 April 2018

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-016-0376-5

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) Perfect graphs (05C17)

Related Items (2)

A survey on the cyclic coloring and its relaxations ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable

Cites Work

• Unnamed Item
• Unnamed Item
• Edge colorings of planar graphs without 5-cycles with two chords
• 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
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• The size of edge chromatic critical graphs with maximum degree 6
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Edge colorings of planar graphs without 6-cycles with three chords