Closure and forbidden pairs for 2-factors

DOI10.1016/J.DISC.2010.02.006zbMATH Open1225.05207OpenAlexW2088978252MaRDI QIDQ968435FDOQ968435

Authors Zdeněk Ryjáček, Khikmat Saburov 

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

closure2-factorforbidden 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)

Recommendations

• Forbidden subgraphs that imply 2-factors
• Closure concept for 2-factors in claw-free graphs
• Forbidden pairs of disconnected graphs for 2‐factor of connected graphs
• Closure and forbidden pairs for Hamiltonicity
• Forbidden subgraphs for existences of (connected) 2-factors of a graph

Cites work

• scientific article; zbMATH DE number 4191710 (Why is no real title available?)
• scientific article; zbMATH DE number 3730183 (Why is no real title available?)
• Characterizations of derived graphs
• Characterizing forbidden pairs for hamiltonian properties
• Closure and forbidden pairs for Hamiltonicity
• Closure concept for 2-factors in claw-free graphs
• Forbidden subgraphs and Hamiltonian properties and graphs
• Forbidden subgraphs that imply 2-factors
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• Graph theory
• On a closure concept in claw-free graphs
• Strengthening the closure concept in claw-free graphs
• Sufficient conditions for a graph to be Hamiltonian

Cited in

(3)

• Closure concept for 2-factors in claw-free graphs
• Stability of hereditary graph classes under closure operations
• Forbidden subgraphs that imply 2-factors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968435)