Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path (Q1671309): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2018.02.024 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2018.02.024 / rank | |||
Normal rank | |||
Latest revision as of 02:16, 11 December 2024
scientific article
| 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 |
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
