IC-planar graphs are odd-10-colorable

DOI10.1016/j.amc.2023.128020MaRDI QIDQ6160615

Runrun Liu, Wei Fan Wang, Chenran Pan

Publication date: 26 June 2023

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

zbMATH Keywords

dischargingreducible configurationIC-planar graphodd coloring

Mathematics Subject Classification ID

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

Cites Work

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

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