TY - JOUR
T1 - Bipartite graphs decomposable into closed trails
AU - Cichacz, Sylwia
AU - Froncek, Dalibar
PY - 2010/8/1
Y1 - 2010/8/1
N2 - Let G = Ka,b, where a, b are even or G = Ka,a -M 2a,, where a > 1 is an odd integer and M2a is a perfect matching in Ka,a. It has been shown ([3,4]) that G is arbitrarily decomposable into closed trails. Billington asked if the graph Kr,s, -F, where s,r are odd and F is a (smallest possible) spanning subgraph of odd degree, is arbitrarily decomposable into closed trails ([2]). In this article we answer the question in the affirmative.
AB - Let G = Ka,b, where a, b are even or G = Ka,a -M 2a,, where a > 1 is an odd integer and M2a is a perfect matching in Ka,a. It has been shown ([3,4]) that G is arbitrarily decomposable into closed trails. Billington asked if the graph Kr,s, -F, where s,r are odd and F is a (smallest possible) spanning subgraph of odd degree, is arbitrarily decomposable into closed trails ([2]). In this article we answer the question in the affirmative.
UR - http://www.scopus.com/inward/record.url?scp=78651542333&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651542333&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:78651542333
SN - 0835-3026
VL - 74
SP - 207
EP - 216
JO - Journal of Combinatorial Mathematics and Combinatorial Computing
JF - Journal of Combinatorial Mathematics and Combinatorial Computing
ER -