Vertex Partitions of Chordal Graphs
| dc.creator | Wood, David R. | |
| dc.date | 2004-08-07 | |
| dc.date.accessioned | 2026-07-07T06:33:53Z | |
| dc.date.available | 2026-07-07T06:33:53Z | |
| dc.description | A \emph{$k$-tree} is a chordal graph with no $(k+2)$-clique. An \emph{$\ell$-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 $\ell$-tree (after deleting loops and replacing parallel edges by a single edge). We prove that for all $k\geq\ell\geq0$, every $k$-tree has an $\ell$-tree-partition in which every bag induces a connected $\floor{k/(\ell+1)}$-tree. An analogous result is proved for oriented $k$-trees. | |
| dc.description | submitted to a journal | |
| dc.identifier | https://arxiv.org/abs/math/0408098 | |
| dc.identifier | http://arxiv.org/abs/math/0408098 | |
| dc.identifier | J. Graph Theory, 53:167-172, 2006. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/99343 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 | |
| dc.title | Vertex Partitions of Chordal Graphs | |
| dc.type | text |