Weak (2, 3)-decomposition of planar graphs

DOI10.37236/11774MaRDI QIDQ6197320

Ming Han, Xuding Zhu

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

planar graphweak \((d, h)\)-decomposition

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)

Cites Work

• Unnamed Item
• Chip games and paintability
• Planar graphs are 1-relaxed, 4-choosable
• Defective 3-paintability of planar graphs
• The Alon-Tarsi number of a planar graph minus a matching
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• List Improper Colourings of Planar Graphs
• Decomposing planar graphs into graphs with degree restrictions

This page was built for publication: Weak (2, 3)-decomposition of planar graphs