Path Partitions of Almost Regular Graphs

Authors

Colton Magnant, Georgia Southern UniversityFollow
Hua Wang, Georgia Southern UniversityFollow
Shuai Yuan, University of South Carolina - Columbia

Document Type

Article

Publication Date

2-2016

Publication Title

Australasian Journal of Combinatorics

ISSN

1034-4942

Abstract

The path partition number of a graph is the minimum number of paths required to partition the vertices. We consider upper bounds on the path partition number under minimum and maximum degree assumptions.

Comments

The Australian Journal of Combinatorics allows for the immediate deposit of our published papers in other repositories, without restriction on re-use.

Recommended Citation

Magnant, Colton, Hua Wang, Shuai Yuan. 2016. "Path Partitions of Almost Regular Graphs." Australasian Journal of Combinatorics, 64 (2): 334-340. source: http://ajc.maths.uq.edu.au/pdf/64/ajc_v64_p334.pdf
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/352