Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
From MaRDI portal
Publication:287897
DOI10.1007/s10255-016-0573-xzbMath1336.05072OpenAlexW2342506041MaRDI QIDQ287897
Publication date: 23 May 2016
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-016-0573-x
Related Items (2)
Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs ⋮ Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
Cites Work
- Unnamed Item
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- On a closure concept in claw-free graphs
- Hamilton cycles in 3-connected claw-free and net-free graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- A reduction method to find spanning Eulerian subgraphs
This page was built for publication: Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs