Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
From MaRDI portal
(Redirected from Publication:287897)
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
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- A reduction method to find spanning Eulerian subgraphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Hamilton cycles in 3-connected claw-free and net-free graphs
- On a closure concept in claw-free graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
Cited in
(8)- Three forbidden subgraphs for line graphs
- Forbidden triples implying Hamiltonicity: for all graphs
- On Turán's \((3,4)\)-problem with forbidden subgraphs
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
- A note on Hamiltonicity of generalized net-free graphs of large diameter
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
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)
