Cyclic decompositions of complete graphs into spanning trees

DOI10.7151/dmgt.1235zbMath1060.05080OpenAlexW1986950197MaRDI QIDQ4669438

Dalibor Fronček

Publication date: 15 April 2005

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1235

zbMATH Keywords

graph labelingspanning treesgraph factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Factorizations of complete graphs into caterpillars of diameter 5 ⋮ Factorizations of complete graphs into tadpoles ⋮ Decomposition of the Kneser graph into paths of length four

This page was built for publication: Cyclic decompositions of complete graphs into spanning trees