A characterization of 2-connected \ K₁ , 3 , N₃ , 1 , 1 \-free non-Hamiltonian graphs
From MaRDI portal
Publication:2659232
Recommendations
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- scientific article; zbMATH DE number 1281388
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
Cites work
- scientific article; zbMATH DE number 4191710 (Why is no real title available?)
- scientific article; zbMATH DE number 1185308 (Why is no real title available?)
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- Characterizing forbidden pairs for hamiltonian properties
- Closure, 2-factors, and cycle coverings in claw-free graphs
- Forbidden subgraphs that imply 2-factors
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Graph theory
- Minimal \(2\)-connected non-Hamiltonian claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On a closure concept in claw-free graphs
Cited in
(4)
This page was built for publication: A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659232)