An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian (Q1707969): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2018.01.010 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2018.01.010 / rank | |||
Normal rank | |||
Latest revision as of 05:04, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian |
scientific article |
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
