Decomposition of complete graphs into connected unicyclic bipartite graphs with eight edges

John Fahnenstiel, Dalibor Froncek

Research output: Contribution to journalArticle

Abstract

We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.

Original languageEnglish (US)
Pages (from-to)235-250
Number of pages16
JournalElectronic Journal of Graph Theory and Applications
Volume7
Issue number2
DOIs
StatePublished - Jan 1 2019

    Fingerprint

Keywords

  • Graph decomposition
  • Rosa type labeling
  • α-labeling
  • α-labeling

Cite this