On Decompositions of \(\mathbf{K_{18k}}\) and \(\mathbf{K_{18k+1}}\) into Certain Connected Bicyclic Graphs with Nine Edges
Utilitas Mathematica · 2024
DOI: 10.61091/um119-05 ↗Kurz gefasst
Fachartikel in der Zeitschrift Utilitas Mathematica, 2024. Verfasst von Dalibor Froncek und 1 weiteren Autor:innen.
Abstract (Originalsprache)
We show that connected, bicyclic graphs on nine edges with at least one cycle other than C 3 decompose the complete graphs K 18 k and K 18 k + 1 , for k ≥ 1 , when the necessary conditions allow for such a decomposition. This complements previous results by Freyberg, Froncek, Jeffries, Jensen, and Sailstad on connected bicyclic triangular graphs.
Zitieren
APA
Froncek, D., & Sailstad, A. (2024). On Decompositions of \(\mathbf{K_{18k}}\) and \(\mathbf{K_{18k+1}}\) into Certain Connected Bicyclic Graphs with Nine Edges. Utilitas Mathematica. https://doi.org/10.61091/um119-05
Vancouver
Froncek D, Sailstad A. On Decompositions of \(\mathbf{K_{18k}}\) and \(\mathbf{K_{18k+1}}\) into Certain Connected Bicyclic Graphs with Nine Edges. Utilitas Mathematica. 2024. doi:10.61091/um119-05
BibTeX
@article{Froncek2024,
author = {Froncek, Dalibor and Sailstad, Andrew},
title = {On Decompositions of \(\mathbfK_18k\) and \(\mathbfK_18k+1\) into Certain Connected Bicyclic Graphs with Nine Edges},
journal = {Utilitas Mathematica},
year = {2024},
doi = {10.61091/um119-05}
}
EUVIMED