IC-planar graphs are odd-10-colorable

DOI10.1016/J.AMC.2023.128020MaRDI QIDQ6160615FDOQ6160615

Authors: Chenran Pan, Weifan Wang, Runrun Liu 

Publication date: 26 June 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Recommendations

• Improper odd coloring of IC-planar graphs
• 1-planar graphs are odd 13-colorable
• An improvement of the bound on the odd chromatic number of 1-planar graphs
• A note on odd colorings of 1-planar graphs
• The odd chromatic number of a planar graph is at most 8

zbMATH Keywords

dischargingreducible configurationIC-planar graphodd coloring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Graph theory (05Cxx)

Cites Work

• A new proof of the 6 color theorem
• Ein Sechsfarbenproblem auf der Kugel
• Coloring plane graphs with independent crossings
• Chromatic number, independence ratio, and crossing number
• Acyclic colouring of 1-planar graphs
• An improved upper bound for the acyclic chromatic number of 1-planar graphs
• Colorings with neighborhood parity condition
• The odd chromatic number of a planar graph is at most 8
• A note on odd colorings of 1-planar graphs
• 1-planar graphs are odd 13-colorable

Cited In (2)

• An improvement of the bound on the odd chromatic number of 1-planar graphs
• Improper odd coloring of IC-planar graphs

This page was built for publication: IC-planar graphs are odd-10-colorable

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