Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
From MaRDI portal
Publication:370939
DOI10.1007/s11425-013-4631-zzbMath1272.05093MaRDI QIDQ370939
Publication date: 20 September 2013
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-013-4631-z
Related Items
Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs, Bipartition of graph under degree constraints, Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Forbidden subgraphs and Hamiltonian properties and graphs
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- On a closure concept in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Acyclic edge coloring of graphs with large girths
- Hamilton cycles in 3-connected claw-free and net-free graphs
- Sufficient conditions for a graph to be Hamiltonian
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian
- Claw-free 3-connectedP11-free graphs are hamiltonian
- A reduction method to find spanning Eulerian subgraphs
- Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs