Decomposition of Certain Complete Bipartite Graphs into Prisms
Dalibor Froncek
Discussiones Mathematicae Graph Theory, Tome 37 (2017), p. 55-62 / Harvested from The Polish Digital Mathematics Library

Häggkvist [6] proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [1] Cichacz and Froncek established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn,n into generalized prisms of order 2n. In [2] and [3] Cichacz, Froncek, and Kovar showed decompositions of K3n/2,3n/2 into generalized prisms of order 2n. In this paper we prove that K6n/5,6n/5 is decomposable into prisms of order 2n when n ≡ 0 (mod 50).

Publié le : 2017-01-01
EUDML-ID : urn:eudml:doc:287971
@article{bwmeta1.element.doi-10_7151_dmgt_1914,
     author = {Dalibor Froncek},
     title = {Decomposition of Certain Complete Bipartite Graphs into Prisms},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {37},
     year = {2017},
     pages = {55-62},
     zbl = {1354.05112},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1914}
}
Dalibor Froncek. Decomposition of Certain Complete Bipartite Graphs into Prisms. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 55-62. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1914/