Arbitrarily vertex decomposable caterpillars with four or five leaves

DOI10.7151/DMGT.1321zbMath1142.05065OpenAlexW1969832626MaRDI QIDQ3508845

Jakub Przybyło, Antoni Marczyk, Sylwia Cichacz, Agnieszka Goerlich

Publication date: 1 July 2008

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1321

zbMATH Keywords

arbitrarily vertex decomposable graphsstar-like treestrees, caterpillars

Mathematics Subject Classification ID

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

Related Items (12)

Dense arbitrarily vertex decomposable graphs ⋮ Partitioning powers of traceable or Hamiltonian graphs ⋮ On minimal arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ Structural properties of recursively partitionable graphs with connectivity 2 ⋮ On arbitrarily vertex decomposable trees ⋮ An Ore-type condition for arbitrarily vertex decomposable graphs ⋮ An Ore-type condition for arbitrarily vertex decomposable graphs ⋮ Arbitrarily vertex decomposable suns with few rays ⋮ On-line arbitrarily vertex decomposable suns ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

This page was built for publication: Arbitrarily vertex decomposable caterpillars with four or five leaves