Luke Branson
University of Minnesota Duluth

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

On decompositions of complete graphs into unicyclic disconnected bipartite graphs on nine edges Alan Bonhert; Luke Branson; Patrick Joseph Otto
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

We use Rosa-type labelings to decompose complete graphs into unicyclic, disconnected, bipartite graphs on nine edges – namely, those featuring cyclic component C4, C6, or C8. For any such graph H, we prove there exists an H-design of K18k + 1 and K18k for all positive integers k.