A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles

DOI10.1007/s00373-023-02708-xMaRDI QIDQ6083188

Fangyu Tian, Xiangwen Li

Publication date: 31 October 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

planar graphgraph decompositionlist coloringdefective coloring

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
• 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
• Colorings and orientations of graphs
• The Alon-Tarsi number of \(K_5\)-minor-free 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\)
• Decomposition of planar graphs with forbidden configurations
• 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

This page was built for publication: A \((2, 1)\)-decomposition of planar graphs without intersecting 3-cycles and adjacent \(4^-\)-cycles