We prove that each of the 34 non-isomorphic connected unicyclic bipartite graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.
|Original language||English (US)|
|Number of pages||16|
|Journal||Electronic Journal of Graph Theory and Applications|
|State||Published - 2019|
- Graph decomposition
- Rosa type labeling