Ore-type degree conditions for disjoint path covers in simple graphs (Q898138)
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: Ore-type degree conditions for disjoint path covers in simple graphs |
scientific article; zbMATH DE number 6517682
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Ore-type degree conditions for disjoint path covers in simple graphs |
scientific article; zbMATH DE number 6517682 |
Statements
Ore-type degree conditions for disjoint path covers in simple graphs (English)
0 references
8 December 2015
0 references
Ore's theorem
0 references
degree condition
0 references
disjoint path cover
0 references
path partition
0 references
Hamiltonian-connected graph
0 references
0 references
0.8854721188545227
0 references
0.8514609336853027
0 references
0.8248748183250427
0 references
0.796943724155426
0 references
0.794318437576294
0 references
