Partitioning Graphs Into Paths or Cycles of Prescribed Lengths

Document Type

Article

Publication Date

2012

Publication Title

Journal of Combinatorics

DOI

10.4310/JOC.2012.v3.n2.a1

ISSN

2150-959X

Abstract

In this paper, we consider the path (and cycle) partition problem for graphs with additional length restrictions. More specifically, we prove sufficient degree sum conditions for the vertices of a graph to be partitioned into paths, with fixed end vertices, such that these paths have approximately prescribed lengths. We also prove similar results for partitions into cycles of approximately prescribed lengths each containing a specified vertex.

Link to Full Text

Share

COinS