Abstract
In (3) Ore poses two problems concerning the decomposition of graphs into edge-disjoint paths. The first is to find the conditions on a graph so that it can be decomposed into a finite number k of edge-disjoint, two-way infinite paths and no fewer. In (2) Nash-Williams solves this problem. The results of (2) are used here to solve the second problem, to find conditions on a graph so that it can be decomposed into a finite number k of edge-disjoint paths (finite, one-way infinite, and two-way infinite) and no fewer.
Publisher
Canadian Mathematical Society
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Eulerian Spaces;Memoirs of the American Mathematical Society;2023-12
2. The mathematics of Bruce Rothschild;Journal of Combinatorial Theory, Series A;2006-01
3. Partitions into odd chains;Mathematical Programming;1987-02
4. Chain decompositions of graphs;Bulletin of the Australian Mathematical Society;1985-06
5. Introduction;Graphs and Order;1985