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

Dalibor Froncek, Michael Kubesa

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper, we completely determine the spectrum of connected unicyclic bipartite graphs with seven edges decomposing complete graphs.

Original languageEnglish (US)
Pages (from-to)52-80
Number of pages29
JournalBulletin of the Institute of Combinatorics and its Applications
Volume93
StatePublished - 2021

Bibliographical note

Funding Information:
The authors would like to express their sincere thanks to the anonymous referee whose thoughtful and detailed comments and suggestions helped to significantly improve the manuscript.

Publisher Copyright:
© 2021

Keywords

  • G-design
  • Graph decomposition
  • ρ-labeling

Fingerprint

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

Cite this