Decomposing K18n and K18n+1 into connected unicyclic graphs with 9 edges.

Autor:	Aspenson, Grace, Baker, Dustin, Freyberg, Bryan, Schwieder, Coy
Předmět:	GRAPH connectivity GRAPH labelings COMPLETE graphs
Zdroj:	Electronic Journal of Graph Theory & Applications; 2023, Vol. 11 Issue 1, p273-316, 44p
Abstrakt:	Other than C9 there are 239 connected unicyclic graphs with exactly 9 edges. We use established graph labeling results to prove that every one of them decomposes the complete graph Kn if n = 0 or 1 (mod 18). [ABSTRACT FROM AUTHOR]
Databáze:	Complementary Index
Externí odkaz:	Zobrazit plný text záznamu