Forbidden pairs for \(k\)-connected Hamiltonian graphs
From MaRDI portal
Publication:764879
DOI10.1016/j.disc.2011.10.019zbMath1237.05119OpenAlexW1990623720MaRDI QIDQ764879
Guantao Chen, Ronald J. Gould, Akira Saito, Yoshimi Egawa
Publication date: 16 March 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.10.019
Related Items
The Hamiltonian properties in \(K_{1,r}\)-free split graphs ⋮ Minimal forbidden sets for degree sequence characterizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a closure concept in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Characterizing forbidden clawless triples implying Hamiltonian graphs
- Forbidden triples for Hamiltonicity
- Forbidden subgraphs that imply 2-factors
- A pair of forbidden subgraphs and perfect matchings.
- Pancyclic graphs. I
- A note on Hamiltonian circuits
- On factors of 4-connected claw-free graphs
- Hamiltonian results inK1,3-free graphs
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- Forbidden triples implying Hamiltonicity: for all graphs
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- Forbidden subgraphs and bounds on the size of a maximum matching
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
