@Article{Cichacz2011,
author = "Cichacz, Sylwia and Görlich, Agnieszka",
title = "Open trails in digraphs",
journal = "Opuscula Math.",
year = "2011",
volume = "31",
number = "4",
pages = "599--604",
doi = "http://dx.doi.org/10.7494/OpMath.2011.31.4.599",
url = "http://dx.doi.org/10.7494/OpMath.2011.31.4.599",
abstract = "It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph \(K_{a,b}\), is decomposable into open trails of prescribed even lengths. In this article we consider the corresponding question for directed graphs. We show that the complete directed graphs \(\overleftrightarrow{K}_n\) and \(\overleftrightarrow{K}_{a,b}\) are arbitrarily decomposable into directed open trails.",
keywords = "trail, graphdecomposition, bipartite graph",
issn = "1232-9274"
}