On arbitrarily vertex decomposable trees

DOI10.1016/j.disc.2007.04.008zbMath1132.05048OpenAlexW2029099922MaRDI QIDQ2470004

Mirko Horňák, Mariusz Woźniak

Publication date: 11 February 2008

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

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

zbMATH Keywords

star-like treearbitrarily vertex decomposable tree

Mathematics Subject Classification ID

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

Related Items (9)

Dense arbitrarily vertex decomposable graphs ⋮ Partitioning powers of traceable or Hamiltonian graphs ⋮ On minimal arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ An Ore-type condition for arbitrarily vertex decomposable graphs ⋮ Decomposing trees with large diameter ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Some families of arbitrarily vertex decomposable graphs ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On-line arbitrarily vertex decomposable trees
• Packing closed trails into dense graphs.
• Decomposable trees: A polynomial algorithm for tripodes
• A degree bound on decomposable trees
• Packing Circuits into K_N
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• On a Problem of Partitions

This page was built for publication: On arbitrarily vertex decomposable trees