3-IC planar graphs are dynamically 9-choosable

DOI10.1016/J.AMC.2025.129932MaRDI QIDQ7249971zbMATH OpenFDO

Authors Wenjuan Wei, Min Chen, Weiqiang Yu

Publication date 19 May 2026

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

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129932

zbMATH Keywords

\(d\)-IC planar graphdynamic coloringdynamically \(k\)-choosablelist dynamic coloring

Mathematics Subject Classification ID

Combinatorics (05-XX) Graph theory (05Cxx)

Cites work

• 2-distance choosability of planar graphs with a restriction for maximum degree
• A new proof of the 6 color theorem
• Conditional colorings of graphs
• Decomposition and r-hued coloring of K₄(7)-minor free graphs
• Dynamic coloring and list dynamic coloring of planar graphs
• Dynamic coloring of graphs having no \(K_5\) minor
• Dynamic coloring of IC-planar graphs
• Dynamic list coloring of 1-planar graphs
• Ein Sechsfarbenproblem auf der Kugel
• Every planar graph is 5-choosable
• Graph \(r\)-hued colorings -- a survey
• scientific article; zbMATH DE number 3900784 (Why is no real title available?)
• scientific article; zbMATH DE number 2197944 (Why is no real title available?)
• List colourings of planar graphs
• On r-hued coloring of connected P₅-free tripartite graphs
• On \(r\)-hued list coloring of \(K_4 ( 7 )\)-minor free graphs
• On dynamic coloring for planar graphs and graphs of higher genus
• The list \(r\)-hued coloring of \(K_{m, n}\)

This page was built for publication: 3-IC planar graphs are dynamically 9-choosable

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