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

Dalibor Froncek, Jehyun Lee

Research output: Contribution to journalArticlepeer-review

Abstract

We show that each of the 35 non-isomorphic bi-cyclic graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.

Original languageEnglish (US)
Pages (from-to)30-49
Number of pages20
JournalBulletin of the Institute of Combinatorics and its Applications
Volume88
StatePublished - 2020

Bibliographical note

Publisher Copyright:
© 2020, BULLETIN OF THE IC. All Rights Reserved

Keywords

  • Graph decomposition
  • tripartite ᵨ-labeling

Fingerprint

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

Cite this