Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path (Q1671309)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path |
scientific article; zbMATH DE number 6933496
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path |
scientific article; zbMATH DE number 6933496 |
Statements
Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path (English)
0 references
6 September 2018
0 references
combinatorial problems
0 references
connected graphs
0 references
Hamiltonian paths
0 references
degree conditions
0 references
induced subgraphs
0 references
0 references
