Partitions of a graph into paths with prescribed endvertices and lengths
From MaRDI portal
Publication:4489491
DOI<163::AID-JGT5>3.0.CO;2-K 10.1002/1097-0118(200006)34:2<163::AID-JGT5>3.0.CO;2-KzbMath0958.05109MaRDI QIDQ4489491
Publication date: 20 September 2000
Full work available at URL: https://doi.org/10.1002/1097-0118(200006)34:2<163::aid-jgt5>3.0.co;2-k
05C38: Paths and cycles
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On the path partition of graphs, Note on semi-linkage with almost prescribed lengths in large graphs, Note on Enomoto and Ota's conjecture for short paths in large graphs, Path partitions of hypercubes, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Enomoto and Ota's conjecture holds for large graphs, An asymptotic version of a conjecture by Enomoto and Ota
Cites Work