Some families of arbitrarily vertex decomposable graphs

DOI10.1016/J.ENDM.2005.06.100zbMath1200.05189OpenAlexW2043874884MaRDI QIDQ3439380

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

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.100

zbMATH Keywords

partition on-linearbitrary partition (vertex decomposition) of trees

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• On-line arbitrarily vertex decomposable trees
• Decomposable trees: A polynomial algorithm for tripodes
• A degree bound on decomposable trees
• On arbitrarily vertex decomposable trees
• An Ore-type condition for arbitrarily vertex decomposable graphs

This page was built for publication: Some families of arbitrarily vertex decomposable graphs