Path decomposition

  • Katherine Heinrich

Abstract

A path-decomposition of a graph is a partition of its edges into subgraphs each of which is a path or a union of paths (a linear forest). We survey known results when the graph and the linear forest are of prescribed types, and when the decomposition satisfies further additional properties.
Published
1993-12-01
Section
Articoli