Xueliang Li

most citedThe rainbow

k

-connectivity of two classes of graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2009★ 1 cited

The rainbow $k$ -connectivity of two classes of graphs

Xueliang Li, Yuefang Sun

A path in an edge-colored graph $G$ , where adjacent edges may be colored the same, is called a rainbow path if no two edges of $G$ are colored the same. For a $κ$ -connected graph $…

math.CO2009

Sharp bounds for the generalized connectivity $κ_{3} (G)$

Shasha Li, Xueliang Li, Wenli Zhou

Let $G$ be a nontrivial connected graph of order $n$ and let $k$ be an integer with $2 \leq k \leq n$ . For a set $S$ of $k$ vertices of $G$ , let $κ (S)$ denote the maximum number $\el…

math.CO2006

Complete Solution for the Rainbow Numbers of Matchings

He Chen, Xueliang Li, Jianhua Tu

For a given graph $H$ and $n \geq 1$ , let $f (n, H)$ denote the maximum number $c$ for which there is a way to color the edges of the complete graph $K_{n}$ with $c$ colors such that ev…

math.CO2006★ 4 cited

Bipartite Rainbow Numbers of Matchings

Xueliang Li, Jianhua Tu, Zemin Jin

Given two graphs $G$ and $H$ , let $f (G, H)$ denote the maximum number $c$ for which there is a way to color the edges of $G$ with $c$ colors such that every subgraph $H$ of $G$ has…

The rainbow k-connectivity of two classes of graphs

Sharp bounds for the generalized connectivity κ3​(G)

Complete Solution for the Rainbow Numbers of Matchings

Bipartite Rainbow Numbers of Matchings

The rainbow $k$ -connectivity of two classes of graphs

Sharp bounds for the generalized connectivity $κ_{3} (G)$