Tree-Partitions with Bounded Degree Trees
- 2 June 2024
- book chapter
- Published by Springer Nature
- p. 203-212
Abstract
No abstract availableKeywords
All Related Versions
This publication has 34 references indexed in Scilit:
- An $O(\log \mathrm {OPT})$ O ( log OPT ) -Approximation for Covering and Packing Minor Models of $\theta _r$ θ rAlgorithmica, 2017
- Packing and Covering Immersion Models of Planar Subcubic Graphs2016
- Parameters Tied to TreewidthJournal of Graph Theory, 2016
- Vertex partitions of chordal graphsJournal of Graph Theory, 2006
- Tree-partite graphs and the complexity of algorithms2005
- Algorithmic Aspects of Tree Width2003
- Domino TreewidthJournal of Algorithms, 1997
- Some results on tree decomposition of graphsJournal of Graph Theory, 1995
- Tree-partitions of infinite graphsDiscrete Mathematics, 1991
- Quotient tree partitioning of undirected graphsBIT Numerical Mathematics, 1986