Every 3-connected \K₁,3,N₁,2,3\-free graph is Hamilton-connected
From MaRDI portal
Publication:292269
Recommendations
- Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian
- Hamilton‐connected {claw,net}‐free graphs, II
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- On forbidden pairs implying Hamilton-connectedness
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
Cites work
- Characterizing forbidden pairs for hamiltonian properties
- Closure and Hamiltonian-connectivity of claw-free graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Graph theory
- Graphe représentatif des arêtes d'un multigraphe
- Hamiltonicity in claw-free graphs
- scientific article; zbMATH DE number 1496417 (Why is no real title available?)
- scientific article; zbMATH DE number 3286813 (Why is no real title available?)
- Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
Cited in
(19)- Every 3-connected distance claw-free graph is Hamilton-connected
- Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
- On s-Hamiltonicity of net-free line graphs
- Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
- Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
- A characterization of 2-connected \(\{ K_{1 , 3} , N_{3 , 1 , 1} \}\)-free non-Hamiltonian graphs
- Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord
- 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?)
- scientific article; zbMATH DE number 1281388 (Why is no real title available?)
- On forbidden pairs implying Hamilton-connectedness
- scientific article; zbMATH DE number 1424871 (Why is no real title available?)
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
- Hamilton‐connected {claw,net}‐free graphs, II
- Hamilton‐connected {claw, net}‐free graphs, I
- Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected
- Forbidden pairs for traceability of 2-connected graphs
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
- Claw-free and N(2,1,0)-free graphs are almost net-free
This page was built for publication: Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q292269)
