Closure and forbidden pairs for 2-factors

DOI10.1016/j.disc.2010.02.006zbMath1225.05207OpenAlexW2088978252MaRDI QIDQ968435

Khikmat Saburov, Zdeněk Ryjáček

Publication date: 5 May 2010

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

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

zbMATH Keywords

2-factorclosureforbidden subgraphclaw-free

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Stability of Hereditary Graph Classes Under Closure Operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closure concept for 2-factors in claw-free graphs
• Forbidden subgraphs and Hamiltonian properties and graphs
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Closure and forbidden pairs for Hamiltonicity
• Sufficient conditions for a graph to be Hamiltonian
• Forbidden subgraphs that imply 2-factors
• Characterizations of derived graphs
• Strengthening the closure concept in claw-free graphs

This page was built for publication: Closure and forbidden pairs for 2-factors