Decomposition of Complete Bipartite Even Graphs into Closed Trails

被引：0
作者：
Mirko Horňák
Mariusz Woźniak
机构：
[1] Institute of Mathematics,Department of Discrete Mathematics, Al. Mickiewicza 30
[2] P. J. Šafárik University,undefined
[3] Jesenná 5,undefined
[4] Faculty of Applied Mathematics AGH,undefined
来源：
Czechoslovak Mathematical Journal | 2003年 / 53卷
关键词：
complete bipartite graph; closed trail; arbitrarily decomposable graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We prove that any complete bipartite graph Ka,b, where a, b are even integers, can be decomposed into closed trails with prescribed even lengths.
引用
收藏
页码：127 / 134
页数：7
相关论文
共 12 条
[1]  
Balister P. N.(2002)Vertex distinguishing colorings of graphs with _(G) = 2 Discrete Math. 252 17-29
[2]  
Bollobás B.(1999)On the vertex-distinguishing proper edge-colorings of graphs J. Combin. Theory Ser. B 75 288-301
[3]  
Schelp R. H.(1997)Vertex-distinguishing proper edge-colorings J. Graph Theory 26 73-82
[4]  
Bazgan C.(1996)Observability of a graph Math. Slovaca 46 21-31
[5]  
Harkat-Benhamdine A.(undefined)undefined undefined undefined undefined-undefined
[6]  
Li H.(undefined)undefined undefined undefined undefined-undefined
[7]  
Woźniak M.(undefined)undefined undefined undefined undefined-undefined
[8]  
Burris A. C.(undefined)undefined undefined undefined undefined-undefined
[9]  
Schelp R. H.(undefined)undefined undefined undefined undefined-undefined
[10]  
Černý J.(undefined)undefined undefined undefined undefined-undefined
12