Bi-cyclic decompositions of complete graphs into spanning trees

DOI10.1016/J.DISC.2003.11.061zbMath1118.05079OpenAlexW2019204428MaRDI QIDQ878620

Dalibor Fronček

Publication date: 26 April 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.061

zbMATH Keywords

decompositionsgraph labellinggraph 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 (5)

Factorizations of complete graphs into brooms ⋮ Factorizations of complete graphs into trees with at most four non-leave vertices ⋮ -labeling of supersubdivided connected graph plus an edge ⋮ Factorizations of complete graphs into caterpillars of diameter 5 ⋮ Factorizations of complete graphs into tadpoles

Cites Work

• On cyclic packing of a tree
• Modular gracious labellings of trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bi-cyclic decompositions of complete graphs into spanning trees