Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
From MaRDI portal
Publication:1671309
DOI10.1016/j.dam.2018.02.024zbMath1394.05063OpenAlexW2796000127MaRDI QIDQ1671309
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.02.024
Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path ⋮ A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path ⋮ Unnamed Item
Cites Work
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- 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
- Recent advances on the Hamiltonian problem: survey III
- Note on Hamilton Circuits
- Updating the hamiltonian problem—A survey
- Some Theorems on Abstract 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
