On tree-partitions of graphs

DOI10.1016/0012-365X(94)00337-IzbMath0844.05078MaRDI QIDQ1910567

Bogdan Oporowski, Guoli Ding

Publication date: 25 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

characterizationwidthforestinfinite graphsgraph minorstree-partition

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (11)

Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ Computing straight-line 3D grid drawings of graphs in linear volume ⋮ Minors in graphs of large \(\theta_r\)-girth ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Edge-treewidth: algorithmic and combinatorial properties ⋮ Partitioning into graphs with only small components ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Vertex-Coloring with Star-Defects ⋮ On tree-partition-width

Cites Work

• Unnamed Item
• Graph minors. III. Planar tree-width
• Graph minors. V. Excluding a planar graph
• The Menger-like property of the three-width of infinite graphs
• Tree-partitions of infinite graphs
• Quickly excluding a planar graph
• Some results on tree decomposition of graphs

This page was built for publication: On tree-partitions of graphs