On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On partitioning the edge set of a graph into internally disjoint paths without exterior vertices |
scientific article |
Statements
On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (English)
0 references
24 January 2012
0 references
envelope
0 references
path pile
0 references
path piling number
0 references
\(\theta \)-pack
0 references
\(\theta \)-ring
0 references
