Some sufficient conditions for 1-planar graphs to be class 1

DOI10.1016/j.tcs.2014.11.031zbMath1318.05020OpenAlexW2053007680MaRDI QIDQ484318

Wenwen Zhang, Jian Liang Wu

Publication date: 6 January 2015

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

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

zbMATH Keywords

cycleedge coloring1-planar graphs

Mathematics Subject Classification ID

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

Related Items (1)

Graph edge coloring: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On edge colorings of 1-planar graphs without adjacent triangles
• On edge colorings of \(1\)-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• 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
• 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: Some sufficient conditions for 1-planar graphs to be class 1