Minimum implicit degree condition restricted to claws for Hamiltonian cycles (Q308339)
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: Minimum implicit degree condition restricted to claws for Hamiltonian cycles |
scientific article; zbMATH DE number 6623641
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum implicit degree condition restricted to claws for Hamiltonian cycles |
scientific article; zbMATH DE number 6623641 |
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
0.9049836
0 references
0.88882786
0 references
0.8844243
0 references
0.88387716
0 references
0.8836632
0 references
0.88233465
0 references
0.8822633
0 references
