Tree-partitions with bounded degree trees

DOI10.1007/978-3-031-47417-0_11MaRDI QIDQ6630448zbMATH OpenFDO

Authors David R. Wood

Publication date 31 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-47417-0_11

zbMATH Keywords

degreepartitions of graphs

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On tree-partition-width
• Partitioning graphs of bounded tree-width
• Partitioning into graphs with only small components
• Vertex partitions of chordal graphs
• scientific article; zbMATH DE number 2065939

Cites work

• scientific article; zbMATH DE number 3917707 (Why is no real title available?)
• scientific article; zbMATH DE number 1375581 (Why is no real title available?)
• scientific article; zbMATH DE number 1944139 (Why is no real title available?)
• A partial k-arboretum of graphs with bounded treewidth
• An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
• Clustered 3-colouring graphs of bounded degree
• Computing straight-line 3D grid drawings of graphs in linear volume
• Distinct distances in graph drawings
• Domino Treewidth
• Graph drawings with few slopes
• Graph minors. II. Algorithmic aspects of tree-width
• Layout of Graphs with Bounded Tree-Width
• Logical aspects of Cayley-graphs: the group case
• Notes on nonrepetitive graph colouring
• On tree-partition-width
• On tree-partitions of graphs
• Packing and covering immersion models of planar subcubic graphs
• Parameters tied to treewidth
• Partitioning \(H\)-minor free graphs into three subgraphs with no large components
• Partitioning into graphs with only small components
• Planar decompositions and the crossing number of graphs with an excluded minor
• Quotient Networks
• Quotient tree partitioning of undirected graphs
• Recent techniques and results on the Erdős-Pósa property
• Simulation of large networks on smaller networks
• Some results on tree decomposition of graphs
• The complexity of finding uniform emulations on fixed graphs
• The complexity of finding uniform emulations on paths and ring networks
• Tree-partitions of infinite graphs
• Vertex partitions of chordal graphs

Cited in

(2)

• Powers of planar graphs, product structure, and blocking partitions
• Product structure of graph classes with strongly sublinear separators

This page was built for publication: Tree-partitions with bounded degree trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6630448)