Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
From MaRDI portal
Publication:2657065
Recommendations
- Spanning trails in a 2-connected graph
- Hamiltonian connectedness in claw-free graphs
- Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
- Forbidden subgraphs that imply hamiltonian‐connectedness*
Cites work
- 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
- A pair of forbidden subgraphs and perfect matchings.
- A reduction method to find spanning Eulerian subgraphs
- Catlin's reduced graphs with small orders
- Characterizing forbidden pairs for hamiltonian properties
- Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
- Degree sum and Hamiltonian-connected line graphs
- Eulerian subgraphs and Hamilton-connected line graphs
- Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected
- Every 3-connected claw-free \(Z_{8}\)-free graph is Hamiltonian
- Forbidden subgraphs and weak locally connected graphs
- Forbidden subgraphs that imply hamiltonian‐connectedness*
- Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
- Graph theory
- Graphs without spanning closed trails
- Hamiltonicity in claw-free graphs
- scientific article; zbMATH DE number 4055653 (Why is no real title available?)
- scientific article; zbMATH DE number 1496417 (Why is no real title available?)
- scientific article; zbMATH DE number 6890310 (Why is no real title available?)
- On forbidden pairs implying Hamilton-connectedness
- Reinforcing the number of disjoint spanning trees
- Supereulerian graphs with small circumference and 3-connected Hamiltonian claw-free graphs
Cited in
(11)- 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
- scientific article; zbMATH DE number 6890310 (Why is no real title available?)
- Strongly spanning trailable graphs in graph family \({C_2}\left ({4,k} \right)\)
- 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
- Hamiltonian claw-free graphs with path-type local degree conditions
- Hamilton-connected claw-free graphs with small parameters
This page was built for publication: Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657065)
