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

DOI10.1007/S00373-021-02353-2MaRDI QIDQ2053694zbMATH OpenOpenAlexFDO

Authors Wenyao Song, Yuanyuan 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 coloringIC-planar graphmaximum degree

Mathematics Subject Classification ID

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

Recommendations

• A sufficient condition for an IC-planar graph to be of class 1
• The structure of plane graphs with independent crossings and its applications to coloring problems
• IC-planar graphs are 6-choosable
• Acyclic edge coloring of IC-planar graphs
• Acyclic coloring of IC-planar graphs

Cites work

• A sufficient condition for a plane graph with maximum degree 6 to be class 1
• Chromatic number, independence ratio, and crossing number
• Edge coloring of graphs with small maximum degrees
• Every planar graph with maximum degree 7 is of class 1
• Graph theory with applications
• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• On edge colorings of \(1\)-planar graphs
• Planar graphs of maximum degree seven are Class I
• The size of edge chromatic critical graphs with maximum degree 6

Cited in

(4)

• The structure of plane graphs with independent crossings and its applications to coloring problems
• A sufficient condition for an IC-planar graph to be of class 1
• IC-planar graphs are 6-choosable
• Improper odd coloring of IC-planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053694)