Decomposing graphs into paths of fixed length

DOI10.1007/s00493-013-2633-7zbMath1299.05270WikidataQ56926560 ScholiaQ56926560MaRDI QIDQ2448964

Carsten Thomassen

Publication date: 5 May 2014

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-013-2633-7

zbMATH Keywords

paths; path decomposition; edge connectivity

Mathematics Subject Classification ID

05C05: Trees

05C38: Paths and cycles

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C40: Connectivity