Minimum implicit degree condition restricted to claws for Hamiltonian cycles (Q308339): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710525515655 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s13226-015-0159-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2157708176 / rank | |||
Normal rank | |||
Revision as of 00:37, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum implicit degree condition restricted to claws for Hamiltonian cycles |
scientific article |
Statements
Minimum implicit degree condition restricted to claws for Hamiltonian cycles (English)
0 references
6 September 2016
0 references
Determining whether a Hamiltonian cycle exists in a given graph is an interesting but NP-complete problem. Recently, many researchers have paid attention to this problem, and many sufficient conditions for a graph exhibiting a Hamiltonian cycle have been given. In this paper, the author gave a sufficient condition for a 2-connected (respectively, 3-connected) graph to contain a Hamiltonian cycle. The results are interesting.
0 references
implicit degree
0 references
Hamilton cycle
0 references
implicit 1-heavy (implicit 2-heavy)
0 references
