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.
| Original language | English |
|---|---|
| Pages (from-to) | 334-340 |
| Number of pages | 7 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 64 |
| Issue number | 2 |
| State | Published - 2016 |
Scopus Subject Areas
- Discrete Mathematics and Combinatorics