Decomposition of Certain Complete Bipartite Graphs into Prisms

Dalibor Froncek. "Decomposition of Certain Complete Bipartite Graphs into Prisms." Discussiones Mathematicae Graph Theory 37.1 (2017): 55-62. <http://eudml.org/doc/287971>.

@article{DaliborFroncek2017,
abstract = {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).},
author = {Dalibor Froncek},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {graph decomposition; bipartite labeling},
language = {eng},
number = {1},
pages = {55-62},
title = {Decomposition of Certain Complete Bipartite Graphs into Prisms},
url = {http://eudml.org/doc/287971},
volume = {37},
year = {2017},
}

TY - JOUR
AU - Dalibor Froncek
TI - Decomposition of Certain Complete Bipartite Graphs into Prisms
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 1
SP - 55
EP - 62
AB - 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).
LA - eng
KW - graph decomposition; bipartite labeling
UR - http://eudml.org/doc/287971
ER -