Decomposing trees with large diameter

DOI10.1016/J.TCS.2010.04.032MaRDI QIDQ986542zbMATH OpenOpenAlexFDO

Authors Romain Ravaux

Publication date 11 August 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.04.032

zbMATH Keywords

arbitrarily partitionable treesdiameterinteger partition

Mathematics Subject Classification ID

Trees (05C05) Graph designs and isomorphic decomposition (05C51) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A degree bound on decomposable trees
• On the shape of decomposable trees
• scientific article; zbMATH DE number 4087704
• Decompositions of graphs into trees
• Decomposable trees: A polynomial algorithm for tripodes

Cites work

• A degree bound on decomposable trees
• A homology theory for spanning tress of a graph
• A linear algorithm for bipartition of biconnected graphs
• A linear-time algorithm for four-partitioning four-connected planar graphs
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Decomposable trees: A polynomial algorithm for tripodes
• scientific article; zbMATH DE number 3603293 (Why is no real title available?)
• On arbitrarily vertex decomposable trees
• On the shape of decomposable trees

Cited in

(13)

• On the shape of decomposable trees
• Decomposable trees: A polynomial algorithm for tripodes
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Partitioning the Cartesian product of a tree and a cycle
• Dense on-line arbitrarily partitionable graphs
• A degree bound on decomposable trees
• On the number of decomposable trees
• Partitioning powers of traceable or Hamiltonian graphs
• On minimal arbitrarily partitionable graphs
• Some properties of minimal arbitrarily partitionable graphs
• Closure results for arbitrarily partitionable graphs
• Arbitrarily edge-partitionable graphs
• A _3 condition for arbitrarily partitionable graphs

This page was built for publication: Decomposing trees with large diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986542)