Zemin Jin

most citedBipartite Rainbow Numbers of Matchings

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

collaborators

2 papers

math.CO2020

Kings and Kernels in Semicomplete Compositions

Yuefang Sun, Zemin Jin

Let $k$ be an integer with $k \geq 2$ . A $k$ -king in a digraph $D$ is a vertex which can reach every other vertex by a directed path of length at most $k$ and a non-king is a vertex…

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…