Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
From MaRDI portal
Publication:2637726
DOI10.1007/S00373-012-1245-0zbMATH Open1284.05148OpenAlexW1993610038MaRDI QIDQ2637726FDOQ2637726
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1245-0
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Characterizing forbidden pairs for hamiltonian properties
- Forbidden subgraphs and Hamiltonian properties and graphs
- Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian
- Sufficient conditions for a graph to be Hamiltonian
- Claw-free 3-connectedP11-free graphs are hamiltonian
- Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
Cited In (8)
- The local structure of claw-free graphs without induced generalized bulls
- Forbidden triples for Hamiltonicity
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Pairs of forbidden class of subgraphs concerning K1,3and P6to have a cycle containing specified vertices
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
This page was built for publication: Two 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 Q2637726)
