On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668)
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: On partitioning the edge set of a graph into internally disjoint paths without exterior vertices |
scientific article; zbMATH DE number 5999814
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On partitioning the edge set of a graph into internally disjoint paths without exterior vertices |
scientific article; zbMATH DE number 5999814 |
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
0.9687583
0 references
0.9185901
0 references
0.9171672
0 references
0.90839386
0 references
0 references
0 references
0.8992136
0 references
0.89158285
0 references
0 references
