An Ore-type condition for arbitrarily vertex decomposable graphs

DOI10.1016/J.DISC.2007.12.066zbMath1179.05089OpenAlexW2178768069MaRDI QIDQ5902102

Antoni Marczyk

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

zbMATH Keywords

independence numberperfect matchingtraceable grapharbitrarily vertex decomposable graph

Mathematics Subject Classification ID

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

Related Items (11)

Dense on-line arbitrarily partitionable graphs ⋮ More aspects of arbitrarily partitionable graphs ⋮ Dense arbitrarily vertex decomposable graphs ⋮ Dense arbitrarily partitionable graphs ⋮ Unnamed Item ⋮ Structural properties of recursively partitionable graphs with connectivity 2 ⋮ Interplays between variations of arbitrarily partitionable graphs under minimality constraints ⋮ Closure results for arbitrarily partitionable graphs ⋮ Arbitrarily edge-partitionable graphs ⋮ Partitioning the Cartesian product of a tree and a cycle ⋮ Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs

Cites Work

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

This page was built for publication: An Ore-type condition for arbitrarily vertex decomposable graphs