On the shape of decomposable trees

DOI10.1016/j.disc.2008.11.012zbMath1221.05036OpenAlexW2159906802MaRDI QIDQ1043555

Hervé Fournier, Romain Ravaux, Dominique Barith

Publication date: 9 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.11.012

zbMATH Keywords

integer partitionshomeomorphism classarbitrarily partitionable treestree partitions

Mathematics Subject Classification ID

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

Related Items (6)

Dense on-line arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ On minimal arbitrarily partitionable graphs ⋮ Decomposing trees with large diameter ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for four-partitioning four-connected planar graphs
• A linear algorithm for bipartition of biconnected graphs
• On-line arbitrarily vertex decomposable trees
• Decomposable trees: A polynomial algorithm for tripodes
• Plane triangulations are 6-partitionable
• A degree bound on decomposable trees
• Parametrized complexity theory.
• A homology theory for spanning tress of a graph

This page was built for publication: On the shape of decomposable trees