Decomposition of planar graphs with forbidden configurations

DOI10.1016/j.dam.2023.02.014OpenAlexW4323687971MaRDI QIDQ2691577

Tao Wang, Lingxi Li, Xuding Zhu, Hua Jing Lu

Publication date: 29 March 2023

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

Full work available at URL: https://arxiv.org/abs/2111.13825

zbMATH Keywords

decompositionlist coloringDP-coloringdefective coloringAlon-Tarsi number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (5)

A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles ⋮ Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Decomposition of toroidal graphs without some subgraphs ⋮ A weak DP-coloring of planar graphs without 4- and 9-cycles

Cites Work

• Unnamed Item
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Planar graphs are 1-relaxed, 4-choosable
• A note on list improper coloring of plane graphs
• On-line DP-coloring of graphs
• The Alon-Tarsi number of a planar graph minus a matching
• The Alon-Tarsi number of planar graphs without cycles of lengths 4 and \(l\)
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• A note on list improper coloring planar graphs
• Decomposing planar graphs into graphs with degree restrictions

This page was built for publication: Decomposition of planar graphs with forbidden configurations