On-line arbitrarily vertex decomposable suns

DOI10.1016/J.DISC.2008.11.025zbMath1218.05138OpenAlexW1970635674MaRDI QIDQ1045163

Rafał Kalinowski, Mariusz Woźniak, Monika Pilśniak, Irmina A. Zioło

Publication date: 15 December 2009

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

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

zbMATH Keywords

arbitrary partition (vertex decomposition) of graphspartition on-line

Mathematics Subject Classification ID

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

Related Items (7)

Dense on-line arbitrarily partitionable graphs ⋮ Dense arbitrarily vertex decomposable graphs ⋮ Dense arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ Arbitrarily vertex decomposable suns with few rays ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On-line arbitrarily vertex decomposable trees
• Decomposable trees: A polynomial algorithm for tripodes
• A degree bound on decomposable trees
• Arbitrarily vertex decomposable caterpillars with four or five leaves

This page was built for publication: On-line arbitrarily vertex decomposable suns