Factorizations of complete graphs into tadpoles

DOI10.1016/J.AKCEJ.2020.02.004zbMath1479.05302OpenAlexW3047964686WikidataQ114211089 ScholiaQ114211089MaRDI QIDQ4956196

Tom Raiman, Michael Kubesa

Publication date: 1 September 2021

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.akcej.2020.02.004

zbMATH Keywords

factorizationcomplete graphunicyclic graphtadpole

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Factorizations of complete graphs into trees with at most four non-leave vertices
• Bi-cyclic decompositions of complete graphs into spanning trees
• Factorizations of complete graphs into caterpillars of diameter 5
• Factorizations of \(K_{m,n}\) into spanning trees
• Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees
• Cyclic decompositions of complete graphs into spanning trees

This page was built for publication: Factorizations of complete graphs into tadpoles