Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 7, No 2 (2019): Electronic Journal of Graph Theory and Applications

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

John Fahnenstiel (Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, MN 55812, U.S.A.)
Dalibor Froncek (Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, MN 55812, U.S.A.)

Article Info

Publish Date
10 Oct 2019

Abstract

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

Copyrights © 2019




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...