An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian (Q1707969): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2018.01.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2792739039 / rank | |||
Normal rank |
Revision as of 21:00, 19 March 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