边染色图中的长彩色路问题
Long heterochromatic paths in edge-colored graphs
摘要
研究了边染色图中的彩色路,给出了满足一定色度条件下的边染色中彩色路的长度的下界。
The heterochromatic paths in edge-colored graphs are studied,and the lower bounds of the length of the heterochromatic paths in edge-colored graphs under color degree conditions are given.
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2010年第12期22-23,27,共3页
Journal of Shandong University(Natural Science)
关键词
边染色图
彩色路
色度
edge-colored graph
heterochromatic path
color degree
参考文献7
-
1BONDY J A, MURTY U S R. Graph theory with applications [M]. London: Macmillan, 1976.
-
2CHEN H, LI X. Long heterochromatic paths in edge-colored graphs [ J/OL ]. The Electronic Journal/OL of Combinatorics, 2005, 12( 1 ) :R33. http://www. combinatorics, org/Volume_ 12/PDF/v12i1r33. pdf.
-
3KANO M, LI X. Monochromatic and heterochromatic subgraphs in edge-colored graphs-A survey[J]. Graph and Combinatorics, 2008, 24(4):237-263.
-
4LI H, LI X, LIU G, et al. The heterochromatic matchings in edge-colored bipartite graph[ J]. Ars combinatorica, 2009, 93: 129-139.
-
5LI H, WANG G. Color degree and heterochromatic matchings in edge-colored bipartite graphs[J].Utilitas Mathematica, 2008, 77 : 145-154.
-
6SUZUKI K. A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph[ J]. Graph and Combinatorics, 2006, 22:261-269.
-
7WANG G, LI H. Heterochromatic matchings in edge-colored bipartite graphs [J/OL]. The Electronic Joumal/OL of Combinatorics, 2008 (15) : R138. http://www, combinatorics, org/Volume 15/PDF/v15ilr138. pdf.
