Some results on tree decomposition of graphs

DOI10.1002/jgt.3190200412zbMath0837.05044OpenAlexW1987286551MaRDI QIDQ4857448

Bogdan Oporowski, Guoli Ding

Publication date: 13 May 1996

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

Full work available at URL: https://doi.org/10.1002/jgt.3190200412

zbMATH Keywords

treewidthtree decomposition

Mathematics Subject Classification ID

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

Related Items (14)

Clustered 3-colouring graphs of bounded degree ⋮ Graph drawings with few slopes ⋮ On tree-partitions of graphs ⋮ Graphs of linear growth have bounded treewidth ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ Trimming of graphs, with application to point labeling ⋮ Partitioning \(H\)-minor free graphs into three subgraphs with no large components ⋮ Logical aspects of Cayley-graphs: the group case ⋮ Communication tree problems ⋮ An Efficient Partitioning Oracle for Bounded-Treewidth Graphs ⋮ Notes on graph product structure theory ⋮ On tree-partition-width ⋮ The size‐Ramsey number of powers of bounded degree trees ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth

This page was built for publication: Some results on tree decomposition of graphs