Degree sequence conditions for a graph to be disjoint path coverable (Q2696615)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree sequence conditions for a graph to be disjoint path coverable |
scientific article |
Statements
Degree sequence conditions for a graph to be disjoint path coverable (English)
0 references
17 April 2023
0 references
connectivity
0 references
Hamiltonicity
0 references
degree sequence
0 references
disjoint path cover
0 references
