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.
No takes yet. Share an insight, caveat, or question.
Fronček et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: