A sufficient condition for an IC-planar graph to be class 1

DOI10.1007/s00373-021-02353-2zbMath1479.05075OpenAlexW3166591137MaRDI QIDQ2053694

Wen Yao Song, Yuan-Yuan Duan

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02353-2

zbMATH Keywords

edge coloringmaximum degreeIC-planar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Cites Work

• Edge coloring of graphs with small maximum degrees
• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• Planar graphs of maximum degree seven are Class I
• On edge colorings of \(1\)-planar graphs
• Chromatic number, independence ratio, and crossing number
• The size of edge chromatic critical graphs with maximum degree 6
• Every planar graph with maximum degree 7 is of class 1
• Unnamed Item
• Unnamed Item

This page was built for publication: A sufficient condition for an IC-planar graph to be class 1