Connected graph G with _2(G) 23 n and K₁, 4-free contains a Hamiltonian path
From MaRDI portal
Publication:1671309
Recommendations
- Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path
- A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
- Hamilton paths in \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
- Connectivity and Hamiltonian connectedness of graphs
- On hamiltonian connectedness of \(K_{1,4}\)-free graphs
Cites work
- A method in graph theory
- Advances on the Hamiltonian problem -- a survey
- Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Note on Hamilton Circuits
- Recent advances on the Hamiltonian problem: survey III
- Some Theorems on Abstract Graphs
- Updating the hamiltonian problem—A survey
Cited in
(9)- On hamiltonian connectedness of \(K_{1,4}\)-free graphs
- Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
- Connectivity and Hamiltonian connectedness of graphs
- Note on the longest paths in \(\{ K_{1,4}, K _{1,4 } + e \}\)-free graphs
- A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
- Degree sum conditions for traceable quasi-claw-free graphs
- On traceable iterated line graph and Hamiltonian path index
- Spanning trees of \(K_{1,4}\)-free graphs with a bounded number of leaves and branch vertices
- Hamilton paths in \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
This page was built for publication: Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671309)
