An Ore-type condition for arbitrarily vertex decomposable graphs

DOI10.1016/j.endm.2005.06.097zbMath1200.05177OpenAlexW2144101312MaRDI QIDQ5899376

Antoni Marczyk

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.097

zbMATH Keywords

arbitrarily vertex decomposable graphstraceable graphs

Mathematics Subject Classification ID

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

Related Items

Some families of arbitrarily vertex decomposable graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Arbitrarily vertex decomposable suns with few rays
• Decomposable trees: A polynomial algorithm for tripodes
• A degree bound on decomposable trees
• Note on Hamilton Circuits
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• A homology theory for spanning tress of a graph