Connectivity and Hamiltonian connectedness of graphs
From MaRDI portal
Let \(\sigma_ m(G)=\min\left\{\sum^ m_{i=1}d(v_ i)\mid\{v_ 1,v_ 2,\ldots,v_ m\}\text{ is an independent set}\right\}\). Theorem: Let \(G\) be a 2-connected graph of order \(n\) with connectivity \(\kappa\), and let \(\sigma_ 3\geq n+\kappa+1\). If \(u,v\in V(G)\) and \(\{u,v\}\) is not a vertex cut of \(G\), then \(G\) contains a Hamiltonian \(u\)-\(v\) path.
Recommendations
- scientific article; zbMATH DE number 1246415
- scientific article; zbMATH DE number 2058271
- scientific article; zbMATH DE number 1782262
- Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
- A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
Cited in
(12)- Segment endpoint visibility graphs are Hamiltonian
- Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
- The property of Hamiltonian connectedness in Toeplitz graphs
- Hamiltonicity in connected regular graphs
- The Hamiltonicity of \(k\)-connected \([s,t]\)-graphs.
- On connectedness and hamiltonicity of direct graph bundles
- Hamiltonian-connectedness of triangulations with few separating triangles
- scientific article; zbMATH DE number 3865327 (Why is no real title available?)
- scientific article; zbMATH DE number 5787327 (Why is no real title available?)
- scientific article; zbMATH DE number 146676 (Why is no real title available?)
- Connectednesses of graphs and congruences
- On (2, k)-Hamilton-connected graphs
This page was built for publication: Connectivity and Hamiltonian connectedness of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801761)
