An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian (Q1707969)
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: An implicit degree condition for k-connected 2-heavy graphs to be Hamiltonian |
scientific article; zbMATH DE number 6855748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian |
scientific article; zbMATH DE number 6855748 |
Statements
An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian (English)
0 references
4 April 2018
0 references
combinatorial problems
0 references
implicit degree
0 references
2-heavy
0 references
essential independent set
0 references
Hamilton cycle
0 references
0.9353082180023192
0 references
0.9207963347434998
0 references
0.9114927649497986
0 references
0.8814537525177002
0 references
0.8805541396141052
0 references
