Mathematical Sciences: Faculty Publications
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.
Recommended Citation
Magnant, Colton, Kenta Ozeki.
2012.
"Partitioning Graphs Into Paths or Cycles of Prescribed Lengths."
Journal of Combinatorics, 3 (2): 135-161.
doi: 10.4310/JOC.2012.v3.n2.a1
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/108
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
