5 citations · 9 across the 9 of their papers we have counts for
7 papers · 1 filter
Long heterochromatic paths in heterochromatic triangle free graphs
He Chen, Xueliang Li
In this paper, graphs under consideration are always edge-colored. We consider long heterochromatic paths in heterochromatic triangle free graphs. Two kinds of such graphs are cons…
Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
Xueliang Li, Fengxia Liu
The monochromatic tree partition number of an -edge-colored graph , denoted by , is the minimum integer such that whenever the edges of are colored with c…
Monochromatic and heterochromatic subgraph problems in a randomly colored graph
Xueliang Li, Jie Zheng
Let be the complete graph with vertices and be different colors. Suppose we randomly and uniformly color the edges of in $c_1, c_2, ..., c_…
Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected -graphs
Xueliang Li, Yan Liu
In the paper "Broersma and Hoede, {\it Path graphs}, J. Graph Theory {\bf 13} (1989) 427-444", the authors proposed a problem whether there is a triple of mutually nonisomorphic co…
Partitioning complete graphs by heterochromatic trees
Zemin Jin, Xueliang Li
A {\it heterochromatic tree} is an edge-colored tree in which any two edges have different colors. The {\it heterochromatic tree partition number} of an -edge-colored graph ,…
On the existence of a rainbow 1-factor in proper coloring of K_{rn}^{(r)}
Xueliang Li, Zhixia Xu
El-Zanati et al proved that for any 1-factorization of the complete uniform hypergraph with and , there is a rainbow 1-…