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.