Vertex partitions of chordal graphs
Author:
- 2 June 2006
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 53 (2) , 167-172
Abstract
A k‐tree is a chordal graph with no (k + 2)‐clique. An ℓ‐tree‐partition of a graph G is a vertex partition of G into ‘bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge). We prove that for all k ≥ ℓ ≥ 0, every k‐tree has an ℓ‐tree‐partition in which each bag induces a connected ${\lfloor k} /(\ell+1) \rfloor$ ‐tree. An analogous result is proved for oriented k‐trees. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 167–172, 2006
Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Layout of Graphs with Bounded Tree-WidthSIAM Journal on Computing, 2005
- Excluding any graph as a minor allows a low tree-width 2-coloringJournal of Combinatorial Theory, Series B, 2004
- Partitioning into graphs with only small componentsJournal of Combinatorial Theory, Series B, 2003
- On Deeply Critical Oriented GraphsJournal of Combinatorial Theory, Series B, 2001
- Surfaces, Tree-Width, Clique-Minors, and PartitionsJournal of Combinatorial Theory, Series B, 2000
- Partitioning Graphs of Bounded Tree-WidthCombinatorica, 1998
- Domino TreewidthJournal of Algorithms, 1997
- On tree-partitions of graphsDiscrete Mathematics, 1996
- Some results on tree decomposition of graphsJournal of Graph Theory, 1995
- Quotient tree partitioning of undirected graphsBIT Numerical Mathematics, 1986