Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: bipartite labeling

Sortuj według:

Ogranicz wyniki do:

Decomposition of Certain Complete Bipartite Graphs into Prisms

100%

Froncek D.

Discussiones Mathematicae Graph Theory

2017

tom 37

nr 1

55-62

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

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Froncek D.

1 2017

Wyniki wyszukiwania

Decomposition of Certain Complete Bipartite Graphs into Prisms