Decomposition of complete graphs into unicyclic graphs with eight edges

Bryan J Freyberg, Dalibor Froncek

Research output: Contribution to journalArticlepeer-review

Abstract

Let G be a tripartite unicyclic graph with eight edges that either (i) contains a triangle or heptagon, or (ii) contains a pentagon and is disconnected. We prove that G decomposes the complete graph Kn whenever the necessary conditions are satisfied. We combine this result with other known results to prove that every unicyclic graph with eight edges other than C% decomposes Kn if and only if n = 0,1 (mod 16).

Original languageEnglish (US)
Pages (from-to)113-131
Number of pages19
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
Volume114
StatePublished - Aug 2020

Bibliographical note

Publisher Copyright:
© 2020 Charles Babbage Research Centre. All rights reserved.

Fingerprint

Dive into the research topics of 'Decomposition of complete graphs into unicyclic graphs with eight edges'. Together they form a unique fingerprint.

Cite this