Decomposing planar graphs into graphs with degree restrictions

DOI10.1002/jgt.22817arXiv2007.01517OpenAlexW3040336391MaRDI QIDQ6081583

Tingting Shan, Eun-Kyung Cho, Xuding Zhu, Ilkyoo Choi, Boram Park, Ringi Kim

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

planar graphgraph 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)

Related Items (4)

Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs ⋮ Decomposition of toroidal graphs without some subgraphs ⋮ Weak (2, 3)-decomposition of planar graphs ⋮ Decomposition of planar graphs with forbidden configurations

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
• Decomposing a graph into forests: the nine dragon tree conjecture is true
• Decomposing a graph into forests
• Planar graphs are 1-relaxed, 4-choosable
• Covering planar graphs with forests, one having bounded maximum degree
• Decompositions of graphs into forests with bounded maximum degree
• Every planar graph is 5-choosable
• Defective and clustered graph colouring
• Defective 3-paintability of planar graphs
• Colorings of plane graphs: a survey
• The game coloring number of pseudo partial \(k\)-trees
• The Alon-Tarsi number of a planar graph minus a matching
• Defective DP-colorings of sparse multigraphs
• Refined activation strategy for the marking game
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• The linear arboricity of some regular graphs
• Game chromatic number of outerplanar graphs
• List Improper Colourings of Planar Graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: Decomposing planar graphs into graphs with degree restrictions