Geodesic
Decomposition of bipartite graphs into closed trails
Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 129-144 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Let ${\rm Lct}(G)$ denote the set of all lengths of closed trails that exist in an even graph $G$. A sequence $(t_1,\dots ,t_p)$ of elements of ${\rm Lct}(G)$ adding up to $|E(G)|$ is $G$-realisable provided there is a sequence $(T_1,\dots ,T_p)$ of pairwise edge-disjoint closed trails in $G$ such that $T_i$ is of length $t_i$ for $i=1,\dots ,p$. The graph $G$ is arbitrarily decomposable into closed trails if all possible sequences are $G$-realisable. In the paper it is proved that if $a\ge 1$ is an odd integer and $M_{a,a}$ is a perfect matching in $K_{a,a}$, then the graph $K_{a,a}-M_{a,a}$ is arbitrarily decomposable into closed trails.
Let ${\rm Lct}(G)$ denote the set of all lengths of closed trails that exist in an even graph $G$. A sequence $(t_1,\dots ,t_p)$ of elements of ${\rm Lct}(G)$ adding up to $|E(G)|$ is $G$-realisable provided there is a sequence $(T_1,\dots ,T_p)$ of pairwise edge-disjoint closed trails in $G$ such that $T_i$ is of length $t_i$ for $i=1,\dots ,p$. The graph $G$ is arbitrarily decomposable into closed trails if all possible sequences are $G$-realisable. In the paper it is proved that if $a\ge 1$ is an odd integer and $M_{a,a}$ is a perfect matching in $K_{a,a}$, then the graph $K_{a,a}-M_{a,a}$ is arbitrarily decomposable into closed trails.
Classification : 05C38, 05C70
Keywords: even graph; closed trail; graph arbitrarily decomposable into closed trails; bipartite graph 
@article{CMJ_2009_59_1_a8,
     author = {Cichacz, Sylwia and Hor\v{n}\'ak, Mirko},
     title = {Decomposition of bipartite graphs into closed trails},
     journal = {Czechoslovak Mathematical Journal},
     pages = {129--144},
     year = {2009},
     volume = {59},
     number = {1},
     mrnumber = {2486620},
     zbl = {1224.05402},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a8/}
}
TY  - JOUR
AU  - Cichacz, Sylwia
AU  - Horňák, Mirko
TI  - Decomposition of bipartite graphs into closed trails
JO  - Czechoslovak Mathematical Journal
PY  - 2009
SP  - 129
EP  - 144
VL  - 59
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a8/
LA  - en
ID  - CMJ_2009_59_1_a8
ER  - 
%0 Journal Article
%A Cichacz, Sylwia
%A Horňák, Mirko
%T Decomposition of bipartite graphs into closed trails
%J Czechoslovak Mathematical Journal
%D 2009
%P 129-144
%V 59
%N 1
%U http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a8/
%G en
%F CMJ_2009_59_1_a8
Cichacz, Sylwia; Horňák, Mirko. Decomposition of bipartite graphs into closed trails. Czechoslovak Mathematical Journal, Tome 59 (2009) no. 1, pp. 129-144. http://geodesic.mathdoc.fr/item/CMJ_2009_59_1_a8/

[1] Balister, P. N.: Packing circuits into $K_N$. Comb. Probab. Comput. 6 (2001), 463-499. | DOI | MR | Zbl

[2] Balister, P. N.: Packing closed trails into dense graphs. J. Comb. Theory, Ser. B 88 (2003), 107-118. | DOI | MR | Zbl

[3] Balister, P. N.: Packing digraphs with directed closed trails. Comb. Probab. Comput. 12 (2003), 1-15. | DOI | MR | Zbl

[4] Chou, Ch.-Ch., Fu, Ch.-M., Huang, W.-Ch.: Decomposition of $K_{n,m}$ into short cycle. Discrete Math. 197/198 (1999), 195-203. | MR

[5] Cichacz, S.: Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails. Discuss. Math. Graph Theory 27 (2007), 241-249. | DOI | MR | Zbl

[6] Cichacz, S., Przybyło, J., Wo'zniak, M.: Decompositions of pseudographs into closed trails of even sizes. Discrete Math., doi:10.1016/j.disc.2008.04.024. | DOI

[7] Horňák, M., Kocková, Z.: On complete tripartite graphs arbitrarily decomposable into closed trails. Tatra Mt. Math. Publ. 36 (2007), 71-107. | MR

[8] Horňák, M., Wo'zniak, M.: Decomposition of complete bipartite even graphs into closed trails. Czech. Math. J. 53 (2003), 127-134. | DOI | MR