An implicit degree condition for relative length of long paths and cycles in graphs (Q287873): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relative length of long paths and cycles in graphs with large degree sums / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3211348 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5628163 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Implicit-degrees and circumferences / rank | |||
Normal rank | |||
Revision as of 00:36, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An implicit degree condition for relative length of long paths and cycles in graphs |
scientific article |
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
