A Survey of the Path Partition Conjecture

The Path Partition Conjecture (PPC) states that if G is any graph and (λ1, λ2) any pair of positive integers such that G has no path with more than λ1 + λ2 vertices, then there exists a partition (V1, V2) of the vertex set of G such that Vi has no path with more than λi vertices, i = 1, 2. We presen...

Full description

Bibliographic Details

Published in:	Discussiones Mathematicae Graph Theory
Main Author:	Frick Marietjie
Format:	Article
Language:	English
Published:	University of Zielona Góra 2013-03-01
Subjects:	path partition conjecture path kernel conjecture generalized colourings additive hereditary properties
Online Access:	https://doi.org/10.7151/dmgt.1673