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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.