Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
From MaRDI portal
Publication:287897
DOI10.1007/S10255-016-0573-XzbMATH Open1336.05072OpenAlexW2342506041MaRDI QIDQ287897FDOQ287897
Authors: Hou-yuan Lin, Zhiquan Hu 
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
Recommendations
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Hamilton‐connected {claw,net}‐free graphs, II
- Hamilton‐connected {claw, net}‐free graphs, I
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
Cites Work
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Title not available (Why is that?)
- Hamilton cycles in 3-connected claw-free and net-free graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
Cited In (8)
- A note on Hamiltonicity of generalized net-free graphs of large diameter
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- Three forbidden subgraphs for line graphs
- Forbidden triples implying Hamiltonicity: for all graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
- On Turán's \((3,4)\)-problem with forbidden subgraphs
This page was built for publication: Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287897)
