Decompositions of digraphs into paths and cycles (Q1063040): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: John W. Moon / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: John W. Moon / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(85)90075-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2078722150 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4096964 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitions of digraphs into paths or circuits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An upper bound on the path number of a digraph / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:41, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decompositions of digraphs into paths and cycles |
scientific article |
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
