Minimum implicit degree condition restricted to claws for Hamiltonian cycles (Q308339): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:21, 30 January 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
