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.05109OpenAlexW4255696962MaRDI 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
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Note on semi-linkage with almost prescribed lengths in large graphs ⋮ On the path partition of graphs ⋮ Paired 2-disjoint path covers of burnt pancake graphs with faulty elements ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Note on Enomoto and Ota's conjecture for short paths in large graphs ⋮ Enomoto and Ota's conjecture holds for large graphs ⋮ Path partitions of hypercubes ⋮ An asymptotic version of a conjecture by Enomoto and Ota
Cites Work
This page was built for publication: Partitions of a graph into paths with prescribed endvertices and lengths