Arbitrarily vertex decomposable suns with few rays

DOI10.1016/j.disc.2008.02.019zbMath1214.05125OpenAlexW1994592279MaRDI QIDQ1025573

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

Publication date: 19 June 2009

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

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

zbMATH Keywords

dominating cyclearbitrary partition (vertex decomposition) of graphspartition on-line

Mathematics Subject Classification ID

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

Related Items

Dense on-line arbitrarily partitionable graphs, Dense arbitrarily vertex decomposable graphs, Dense arbitrarily partitionable graphs, Unnamed Item, Unnamed Item, Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles, An Ore-type condition for arbitrarily vertex decomposable graphs, 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
• On-line arbitrarily vertex decomposable suns
• Decomposable trees: A polynomial algorithm for tripodes
• A degree bound on decomposable trees
• Arbitrarily vertex decomposable caterpillars with four or five leaves