Page 1

## Displaying 1 – 9 of 9

Showing per page

### Combinatorial vs. algebraic characterizations of completely pseudo-regular codes.

The Electronic Journal of Combinatorics [electronic only]

### Decomposing complete equipartite graphs into short odd cycles.

The Electronic Journal of Combinatorics [electronic only]

### Decomposition of Complete Bipartite Multigraphs Into Paths and Cycles Having k Edges

Discussiones Mathematicae Graph Theory

We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), [...] and k(p + q) = 2mn for k ≡ 0 (mod 2) and also when λ ≥ 3, λm ≡ λn ≡ 0(mod 2), k(p + q) =λ_mn, m, n ≥ k, (resp., m, n ≥ 3k/2) for k ≡ 0(mod 4) (respectively, for k ≡ 2(mod 4)). In fact, the necessary conditions given above are also sufficient when λ = 2.

### Decomposition of complete graphs into $\left(0,2\right)$-prisms

Czechoslovak Mathematical Journal

R. Frucht and J. Gallian (1988) proved that bipartite prisms of order $2n$ have an $\alpha$-labeling, thus they decompose the complete graph ${K}_{6nx+1}$ for any positive integer $x$. We use a technique called the ${\rho }^{+}$-labeling introduced by S. I. El-Zanati, C. Vanden Eynden, and N. Punnim (2001) to show that also some other families of 3-regular bipartite graphs of order $2n$ called generalized prisms decompose the complete graph ${K}_{6nx+1}$ for any positive integer $x$.

### Graph products and new solutions to Oberwolfach problems.

The Electronic Journal of Combinatorics [electronic only]

### $H$-decompositions of $r$-graphs when $H$ is an $r$-graph with exactly 2 edges.

The Electronic Journal of Combinatorics [electronic only]

### On Decomposing Regular Graphs Into Isomorphic Double-Stars

Discussiones Mathematicae Graph Theory

A double-star is a tree with exactly two vertices of degree greater than 1. If T is a double-star where the two vertices of degree greater than one have degrees k1+1 and k2+1, then T is denoted by Sk1,k2 . In this note, we show that every double-star with n edges decomposes every 2n-regular graph. We also show that the double-star Sk,k−1 decomposes every 2k-regular graph that contains a perfect matching.

### Some gregarious cycle decompositions of complete equipartite graphs.

The Electronic Journal of Combinatorics [electronic only]

### Symmetric Hamilton Cycle Decompositions of Complete Multigraphs

Discussiones Mathematicae Graph Theory

Let n ≥ 3 and ⋋ ≥ 1 be integers. Let ⋋Kn denote the complete multigraph with edge-multiplicity ⋋. In this paper, we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m for all even ⋋ ≥ 2 and m ≥ 2. Also we show that there exists a symmetric Hamilton cycle decomposition of ⋋K2m − F for all odd ⋋ ≥ 3 and m ≥ 2. In fact, our results together with the earlier results (by Walecki and Brualdi and Schroeder) completely settle the existence of symmetric Hamilton cycle decomposition of...

Page 1