Decomposition of Certain Complete Bipartite Graphs into Prisms

• Autorzy: Dalibor Froncek
• Języki publikacji: EN

Abstrakty

EN

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).

Słowa kluczowe

EN

graph decomposition; bipartite labeling

Kategorie tematyczne

• 05C70: Factorization, matching, partitioning, covering and packing
• 05C78: Graph labelling (graceful graphs, bandwidth, etc.)

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 1
• Strony: 55-62

Daty

wydano

2017-02-01

otrzymano

2015-01-26

poprawiono

2016-02-13

zaakceptowano

2016-02-13

online

2017-01-13

Twórcy

autor

Dalibor Froncek

• University of Minnesota Duluth, Duluth, MN 55812-3000

Identyfikatory

DOI

10.7151/dmgt.1914