Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
From MaRDI portal
Publication:2637726
DOI10.1007/S00373-012-1245-0zbMATH Open1284.05148OpenAlexW1993610038MaRDI QIDQ2637726FDOQ2637726
Authors: Zhiquan Hu, Hou-yuan Lin 
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
Recommendations
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- scientific article; zbMATH DE number 1210918
Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75)
Cites Work
- On a closure concept in claw-free graphs
- A reduction method to find spanning Eulerian subgraphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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 (17)
- The local structure of claw-free graphs without induced generalized bulls
- Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs
- Forbidden triples for Hamiltonicity
- Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- Characterizing the difference between graph classes defined by forbidden pairs including the claw
- 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
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- Hamiltonicity and forbidden subgraphs in 4‐connected graphs
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
- Pairs of forbidden class of subgraphs concerning K1,3and P6to have a cycle containing specified vertices
- Forbidden triples implying Hamiltonicity: for all graphs
- Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
- Hamiltonian property of 3-connected \([5,3]\)-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)
