Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Dalibor Froncek
Department of Mathematics and Statistics, University of Minnesota Duluth, Duluth, MN 55812, U.S.A.
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Decomposition of complete graphs into connected bipartite unicyclic graphs with eight edges John Fahnenstiel; Dalibor Froncek
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 7, No 2 (2019): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2019.7.2.4

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.
Co-Authors John Fahnenstiel