Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
