Decomposition of complete bipartite even graphs into closed trails
Czechoslovak Mathematical Journal, Tome 53 (2003) no. 1, pp. 127-134
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
We prove that any complete bipartite graph $K_{a,b}$, where $a,b$ are even integers, can be decomposed into closed trails with prescribed even lengths.
We prove that any complete bipartite graph $K_{a,b}$, where $a,b$ are even integers, can be decomposed into closed trails with prescribed even lengths.
Classification :
05C70
Keywords: complete bipartite graph; closed trail; arbitrarily decomposable graph
Keywords: complete bipartite graph; closed trail; arbitrarily decomposable graph
@article{CMJ_2003_53_1_a10,
author = {Hor\v{n}\'ak, Mirko and Wo\'zniak, Mariusz},
title = {Decomposition of complete bipartite even graphs into closed trails},
journal = {Czechoslovak Mathematical Journal},
pages = {127--134},
year = {2003},
volume = {53},
number = {1},
mrnumber = {1962004},
zbl = {1010.05054},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2003_53_1_a10/}
}
Horňák, Mirko; Woźniak, Mariusz. Decomposition of complete bipartite even graphs into closed trails. Czechoslovak Mathematical Journal, Tome 53 (2003) no. 1, pp. 127-134. http://geodesic.mathdoc.fr/item/CMJ_2003_53_1_a10/