Decomposing complete tripartite graphs into closed trails of arbitrary lengths

Title:

Decomposing complete tripartite graphs into closed trails of arbitrary lengths

Creator:

Billington, Elizabeth J. and Cavenagh, Nicholas J.

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:523879a6-77b0-4781-a58c-f5dde228458f
uuid:523879a6-77b0-4781-a58c-f5dde228458f

Subject:

cycles and decomposing complete tripartite graphs

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

The complete tripartite graph $K_{n,n,n}$ has $3n^2$ edges. For any collection of positive integers $x_1,x_2,\dots ,x_m$ with $\sum _{i=1}^m x_i=3n^2$ and $x_i\ge 3$ for $1\le i\le m$, we exhibit an edge-disjoint decomposition of $K_{n,n,n}$ into closed trails (circuits) of lengths $x_1,x_2,\dots ,x_m$.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Coverage:

523-551

Source:

Czechoslovak Mathematical Journal | 2007 Volume:57 | Number:2

Harvested from:

CDK

Metadata only:

false