A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
From MaRDI portal
Publication:2659232
DOI10.1016/j.disc.2021.112321zbMath1460.05105OpenAlexW3128902974MaRDI QIDQ2659232
Publication date: 25 March 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112321
Related Items
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs ⋮ Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
Cites Work
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On a closure concept in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Minimal \(2\)-connected non-Hamiltonian claw-free graphs
- Forbidden subgraphs that imply 2-factors
- Graph Theory
- Closure, 2-factors, and cycle coverings in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item