On arbitrarily vertex decomposable trees

DOI10.1016/J.DISC.2007.04.008MaRDI QIDQ2470004zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On-line arbitrarily vertex decomposable trees
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• scientific article; zbMATH DE number 5238175
• Recursively arbitrarily vertex-decomposable graphs

Cites work

• A degree bound on decomposable trees
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Decomposable trees: A polynomial algorithm for tripodes
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• On a Problem of Partitions
• On complete tripartite graphs arbitrarily decomposable into closed trails
• On-line arbitrarily vertex decomposable trees
• Packing circuits into \(K_N\).
• Packing closed trails into dense graphs.

Cited in

(16)

• Partitioning powers of traceable or Hamiltonian graphs
• Some families of arbitrarily vertex decomposable graphs
• Partitioning the Cartesian product of a tree and a cycle
• Decomposing trees with large diameter
• Interplays between variations of arbitrarily partitionable graphs under minimality constraints
• Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs
• Arbitrarily vertex decomposable trees are of maximum degree at most six
• Dense arbitrarily vertex decomposable graphs
• Partitioning the Cartesian product of a sun-like graph and a path
• On minimal arbitrarily partitionable graphs
• Closure results for arbitrarily partitionable graphs
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Arbitrarily edge-partitionable graphs
• On vertex \(b\)-critical trees
• An Ore-type condition for arbitrarily vertex decomposable graphs
• On-line arbitrarily vertex decomposable trees

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

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