Graph decompositions and factorizing permutations.

Capelle, Christian; Habib, Michel; de Montgolfier, Fabien

Displaying similar documents to “Graph decompositions and factorizing permutations.”

Problem presented at the workshop in Krynica 2004

Michael Kubesa, Dalibor Froncek (2006)

Discussiones Mathematicae Graph Theory

Similarity:

The k-point-arboricity of a graph

Don R. Lick (1976)

Colloquium Mathematicae

Similarity:

Decomposition of Certain Complete Bipartite Graphs into Prisms

Dalibor Froncek (2017)

Discussiones Mathematicae Graph Theory

Similarity:

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