Abstract
We show that each of the 35 non-isomorphic bi-cyclic graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.
Original language | English (US) |
---|---|
Pages (from-to) | 30-49 |
Number of pages | 20 |
Journal | Bulletin of the Institute of Combinatorics and its Applications |
Volume | 88 |
State | Published - 2020 |
Bibliographical note
Publisher Copyright:© 2020, BULLETIN OF THE IC. All Rights Reserved
Keywords
- Graph decomposition
- tripartite ᵨ-labeling