×

zbMATH — the first resource for mathematics

Path partitions of almost regular graphs. (English) Zbl 1333.05243
Summary: 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.

MSC:
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C38 Paths and cycles
PDF BibTeX XML Cite
Full Text: Link