M. Hornak, Institute of Mathematics, P. J. Safarik University, Jesenna 5, 041 54 Kosice, Slovakia, e-mail: hornak@science.upjs.sk; M. Wozniak, Faculty of Applied Mathematics AGH, Department of Discrete Mathematics, Al. Mickiewicza 30, 30-059 Krakow, Poland, e-mail: mwozniak@uci.agh.edu.pl
Abstract: 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.
Keywords: complete bipartite graph, closed trail, arbitrarily decomposable graph
Classification (MSC 2000): 05C70
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade.
To activate your access, please contact Myris Trade at myris@myris.cz.
Subscribers of Springer (formerly Kluwer) need to access the articles on their site, which is http://www.springeronline.com/10587.
