Decomposition of certain complete bipartite graphs into prisms

Citation data:

Discussiones Mathematicae Graph Theory, ISSN: 1234-3099, Vol: 37, Issue: 1, Page: 55-62

Publication Year:
Usage 14
Full Text Views 9
Abstract Views 5
Dalibor Froncek
Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora
article description
H'aggkvist [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 K into generalized prisms of order 2n. In this paper we prove that K is decomposable into prisms of order 2n when n = 0 (mod 50).

This article has 0 Wikipedia reference.