The Decomposition of Graphs into a Finite Number of Paths
Work
Year: 1965
Type: article
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 edg... more
Source: Canadian Journal of Mathematics
Author Bruce Rothschild
Institution Yale University
Cites: 3
Cited by: 10
Related to: 10
FWCI: 0.478
Citation percentile (by year/subfield): 69.8
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze