Decomposing 4-connected planar triangulations into two trees and one path

DOI10.1016/J.JCTB.2018.05.006zbMath1402.05176arXiv1710.02411OpenAlexW2962877123WikidataQ129801585 ScholiaQ129801585MaRDI QIDQ1633745

Kolja Knauer, Torsten Ueckerdt

Publication date: 20 December 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsdecomposition into trees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

The interval number of a planar graph is at most three

Cites Work

• Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\)
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
• Decomposing a graph into forests
• Decomposition of sparse graphs, with application to game coloring number
• Covering planar graphs with forests, one having bounded maximum degree
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Floorplanning by graph dualization: \(L\)-shaped modules
• Covering planar graphs with forests
• The incidence game chromatic number of \((a,d)\)-decomposable graphs
• Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
• Covering a Graph by Forests and a Matching
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-partitions of planar graphs and their game coloring numbers

This page was built for publication: Decomposing 4-connected planar triangulations into two trees and one path