J. Tu

most citedBipartite Rainbow Numbers of Matchings

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

collaborators

4 papers

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…

math.CO2006

NP-completeness of 4-incidence colorability of semi-cubic graphs

Xueliang Li, Jianhua Tu

The incidence coloring conjecture, proposed by Brualdi and Massey in 1993, states that the incidence coloring number of every graph is at most $Δ + 2$ , where $Δ$ is the m…

math.CO2005

Heterochromatic tree partition number of a complete multipartite graph

He Chen, Zemin Jin, Xueliang Li +1

This paper has been withdrawn by the author(s), due an error in the proof.