Decompositions of digraphs into paths and cycles (Q1063040)
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: Decompositions of digraphs into paths and cycles |
scientific article; zbMATH DE number 3914347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions of digraphs into paths and cycles |
scientific article; zbMATH DE number 3914347 |
Statements
Decompositions of digraphs into paths and cycles (English)
0 references
1985
0 references
If A denotes a subset of the vertex set V of a directed graph G, let f(A) denote the number of arcs directed from a vertex of A to a vertex of \(V\setminus A\); let \(\lambda_ G\) denote the supremum of f(A) over all subsets A. The author shows, among other things, that there exists a partition of the arcs of any directed graph G into at most \(\lambda_ G\) elementary paths and cycles.
0 references
directed graph
0 references
paths
0 references
cycles
0 references
