On arbitrarily vertex decomposable trees

DOI10.1016/J.DISC.2007.04.008zbMATH Open1132.05048OpenAlexW2029099922MaRDI QIDQ2470004FDOQ2470004

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a Problem of Partitions
• Packing circuits into \(K_N\).
• Packing closed trails into dense graphs.
• Decomposable trees: A polynomial algorithm for tripodes
• A degree bound on decomposable trees
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• Decomposition of Complete Bipartite Even Graphs into Closed Trails
• On-line arbitrarily vertex decomposable trees

Cited In (14)

• Partitioning powers of traceable or Hamiltonian graphs
• Some families of arbitrarily vertex decomposable graphs
• Title not available (Why is that?)
• 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
• Dense arbitrarily vertex decomposable graphs
• 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

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)