Previous |  Up |  Next

Article

Title: Decomposition of complete bipartite even graphs into closed trails (English)
Author: Horňák, Mirko
Author: Woźniak, Mariusz
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 53
Issue: 1
Year: 2003
Pages: 127-134
Summary lang: English
.
Category: math
.
Summary: 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. (English)
Keyword: complete bipartite graph
Keyword: closed trail
Keyword: arbitrarily decomposable graph
MSC: 05C70
idZBL: Zbl 1010.05054
idMR: MR1962004
.
Date available: 2009-09-24T10:59:51Z
Last updated: 2020-07-03
Stable URL: http://hdl.handle.net/10338.dmlcz/127786
.
Reference: [1] P. N.  Balister: Packing circuits into $K_{n}$.(to appear). Zbl 1113.05309
Reference: [2] P. N.  Balister, B.  Bollobás and R. H.  Schelp: Vertex distinguishing colorings of graphs with $\Delta (G)=2$.Discrete Math. 252 (2002), 17–29. MR 1907743, 10.1016/S0012-365X(01)00287-4
Reference: [3] P. N.  Balister, A.  Kostochka, H.  Li and R. H.  Schelp: Balanced edge colorings.Manuscript, 1999, pp. 16. MR 2041315
Reference: [4] C.  Bazgan, A.  Harkat-Benhamdine, H.  Li and M.  Woźniak: On the vertex-distinguishing proper edge-colorings of graphs.J.  Combin. Theory Ser. B 75 (1999), 288–301. MR 1676894, 10.1006/jctb.1998.1884
Reference: [5] A. C.  Burris and R. H.  Schelp: Vertex-distinguishing proper edge-colorings.J.  Graph Theory 26 (1997), 73–82. MR 1469354, 10.1002/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C
Reference: [6] J.  Černý, M.  Horňák and R.  Soták: Observability of a graph.Math. Slovaca 46 (1996), 21–31. MR 1414406
.

Files

Files Size Format View
CzechMathJ_53-2003-1_11.pdf 344.2Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo