Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Dustin Baker
University of Minnesota Duluth
Electrical & Electronics Engineering

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

Found 1 Documents
Search

 1 
Decomposing K18n and K18n + 1 into connected unicyclic graphs with 9 edges Grace Aspenson; Dustin Baker; Bryan Freyberg; Coy Schwieder
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): 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.2023.11.1.22

Abstract

Other than C9 there are 239 connected unicyclic graphs with exactly 9 edges. We use established graph labeling results to prove that every one of them decomposes the complete graph Kn if n ≡ 0 or 1 (mod 18).
Co-Authors Bryan Freyberg Coy Schwieder Grace Aspenson