The number of excluded minors for the graphs with path-width at most two is too large. To give a practical characterization of the obstructions for path-width at most two, we introduce the concept reducibility. We describe some operations, which preserve path-width at most two, and reduce the excluded minors to smaller graphs. In this sense, there are ten… (More)

@inproceedings{Bart2007OperationsWP,
title={Operations which preserve path-width at most two},
author={J{\'a}nos Bar{\'a}t and P{\'e}ter Hajnal},
year={2007}
}