Closure and forbidden pairs for Hamiltonicity

DOI10.1006/jctb.2002.2131zbMath1029.05091OpenAlexW2063230542MaRDI QIDQ1403925

Zdeněk Ryjáček

Publication date: 20 August 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2002.2131

zbMATH Keywords

HamiltonianClosureForbidden Pairs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Closure and forbidden pairs for 2-factors ⋮ Characterizing the difference between graph classes defined by forbidden pairs including the claw ⋮ Stability of Hereditary Graph Classes Under Closure Operations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forbidden subgraphs and Hamiltonian properties and graphs
• Forbidden subgraphs, stability and hamiltonicity
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Sufficient conditions for a graph to be Hamiltonian
• Strengthening the closure concept in claw-free graphs

This page was built for publication: Closure and forbidden pairs for Hamiltonicity