×

zbMATH — the first resource for mathematics

Path-decompositions. (English) Zbl 0790.05065
Summary: 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.

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