On decompositions of complete graphs into unicyclic disconnected bipartite graphs on nine edges

被引:1
|
作者
Bohnert, Alan [1 ]
Branson, Luke [1 ]
Otto, Patrick [1 ]
机构
[1] Univ Minnesota Duluth, Dept Math & Stat, Duluth, MN 55812 USA
关键词
Rosa-type labelings; graph decompositions; unicyclic graphs;
D O I
10.5614/ejgta.2023.11.1.24
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We use Rosa-type labelings to decompose complete graphs into unicyclic, disconnected, bipartite graphs on nine edges - namely, those featuring cyclic component C4, C6, or C8. For any such graph H, we prove there exists an H-design of K18k+1 and K18k for all positive integers k.
引用
收藏
页码:329 / 341
页数:13
相关论文
共 50 条