An implicit degree condition for relative length of long paths and cycles in graphs (Q287873)
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: An implicit degree condition for relative length of long paths and cycles in graphs |
scientific article; zbMATH DE number 6583911
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An implicit degree condition for relative length of long paths and cycles in graphs |
scientific article; zbMATH DE number 6583911 |
Statements
An implicit degree condition for relative length of long paths and cycles in graphs (English)
0 references
23 May 2016
0 references
Hamiltonian path
0 references
dominating cycles
0 references
implicit degree
0 references
longest paths
0 references
longest cycles
0 references
0.9038078784942628
0 references
0.9036632180213928
0 references
0.8815019726753235
0 references
