Characterizing forbidden clawless triples implying Hamiltonian graphs
From MaRDI portal
Publication:1598843
DOI10.1016/S0012-365X(01)00235-7zbMath0990.05091MaRDI QIDQ1598843
Ronald J. Gould, Ralph J. Faudree, Michael S. Jacobson, Linda Lesniak
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (9)
Forbidden set of induced subgraphs for 2-connected supereulerian graphs ⋮ Forbidden subgraphs generating a finite set ⋮ Forbidden induced subgraphs for star-free graphs ⋮ A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Non-minimal degree-sequence-forcing triples ⋮ Forbidden triples for perfect matchings ⋮ Forbidden subgraphs and the existence of a 2-factor ⋮ Forbidden pairs for \(k\)-connected Hamiltonian graphs
This page was built for publication: Characterizing forbidden clawless triples implying Hamiltonian graphs
