3-connected \K₁,3,P₉\-free graphs are Hamiltonian-connected
From MaRDI portal
Publication:742625
Recommendations
- 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
- Publication:4945895
- scientific article; zbMATH DE number 1281388
- Hamiltonian results inK1,3-free graphs
- A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian
- 9-connected claw-free graphs are Hamilton-connected
- scientific article; zbMATH DE number 867709
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
- On Hamiltonicity of 3-connected P₃-dominated graphs
Cites work
- 9-connected claw-free graphs are Hamilton-connected
- Characterizing forbidden pairs for hamiltonian properties
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- Hamiltonicity in claw-free graphs
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 1496417 (Why is no real title available?)
- On forbidden pairs implying Hamilton-connectedness
- On graph closures
Cited in
(20)- 9-connected claw-free graphs are Hamilton-connected
- 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
- A note on 3-connected hourglass-free claw-free Hamilton-connected graphs
- Hamiltonian extendable graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- The maximum degree of a minimally Hamiltonian-connected graph
- Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- scientific article; zbMATH DE number 1210918 (Why is no real title available?)
- On forbidden pairs implying Hamilton-connectedness
- Hamilton‐connected {claw,net}‐free graphs, II
- Hamilton‐connected {claw, bull}‐free graphs
- Hamilton‐connected {claw, net}‐free graphs, I
- A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs
- Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected
- Exploring Hamilton-connectedness in \(\{K_{1, 3}, \Gamma_0, P_{18} \}\)-free graphs
- Forbidden pairs for traceability of 2-connected graphs
- Forbidden pairs for \(k\)-connected Hamiltonian graphs
This page was built for publication: 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742625)
