Multidecompositions of line graphs of complete graphs
2019 ◽
Vol 11
(03)
◽
pp. 1950035
◽
By a [Formula: see text]-decomposition of a graph [Formula: see text] we mean a decomposition of [Formula: see text] into [Formula: see text] copies of [Formula: see text] [Formula: see text] copies of [Formula: see text] and [Formula: see text] copies of [Formula: see text], where [Formula: see text] are non-negative integers. In this paper, it is proved that the necessary conditions for the existence of a [Formula: see text]-decomposition of [Formula: see text] are sufficient, where B, the bowtie, is the graph with two triangles having exactly one common vertex. Further, it is shown that the line graph of [Formula: see text] [Formula: see text] has a [Formula: see text]-decomposition except for [Formula: see text].
Keyword(s):
2012 ◽
Vol Vol. 14 no. 2
(Graph Theory)
◽
2021 ◽
Vol 10
(1)
◽
pp. 61-75
2018 ◽
Vol 7
(4.10)
◽
pp. 64
Keyword(s):
2019 ◽
Vol 19
(04)
◽
pp. 2050074
Keyword(s):
2014 ◽
Vol 599-601
◽
pp. 1566-1570
Keyword(s):