Decomposition of Complete Bipartite Even Graphs into Closed Trails
by
M. Horňák
Kosice
Coauthors: M. Wo\'zniak (Kraków)

A graph is even if the degrees of all its vertices are even. Let Lct(G) be the set of all integers l such that there is a closed trail of length l in G and Sct(G) the set of all sequences (l₁, l₂, ... , l_p) such that l_i in Lct(G), i=1, 2, ... , p, and \sum_i=1^pl_i = |E(G)|. A connected even graph G is arbitrarily decomposable into closed trails if, for any sequence (l₁, l₂, ... , l_p) in Sct(G), G can be (edge-disjointly) decomposed into closed trails T₁, T₂, ... , T_p of lengths l₁, l₂, ... , l_p, respectively.

Date received: May 26, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafd-11.