Dynamic coloring of IC-planar graphs

DOI10.1016/J.DAM.2025.05.048MaRDI QIDQ6950404zbMATH OpenFDO

Authors Xiaoxue Hu, Jiangxu Kong, Weifan Wang, Wanshun Yang

Publication date 31 July 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.05.048

zbMATH Keywords

dynamic coloringIC-planar graphvertex coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites work

• A new proof of the 6 color theorem
• Coloring plane graphs with independent crossings
• Dynamic coloring and list dynamic coloring of planar graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• Dynamic list coloring of 1-planar graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Graph \(r\)-hued colorings -- a survey
• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
• Weak-dynamic coloring of graphs beyond-planarity

Cited in

(1)

• 3-IC planar graphs are dynamically 9-choosable

This page was built for publication: Dynamic coloring of IC-planar graphs

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