Decomposition of complete graphs into tri-cyclic graphs with eight edges

Dalibor Froncek, Bethany Kubik

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


In this paper, we use standard graph labeling techniques to prove that each tri-cyclic graph with eight edges decomposes the complete graph Knif and only if n = 0,1 (mod 16). We apply ^-tripartite labelings and 1-rotational p-tripartite labelings.

Original languageEnglish (US)
Pages (from-to)143-165
Number of pages23
JournalJournal of Combinatorial Mathematics and Combinatorial Computing
StatePublished - Aug 2020

Bibliographical note

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


  • G-design
  • Graph decomposition
  • P-labeling


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

Cite this