On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices

G. R. Vijayakumar. On Partitioning the Edge Set of a Graph into Internally Disjoint Paths without Exterior Vertices. Graphs and Combinatorics, 27(1):143-148, 2011. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: