4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2006★ 4 cited
Bipartite Rainbow Numbers of Matchings
Xueliang Li, Jianhua Tu, Zemin Jin
Given two graphs and , let denote the maximum number for which there is a way to color the edges of with colors such that every subgraph of has…
math.CO2006
Generalization of matching extensions in graphs (II)
Zemin Jin, Huifang Yan, Qinglin Yu
Proposed as a general framework, Liu and Yu(Discrete Math. 231 (2001) 311-320) introduced -graphs to unify the concepts of deficiency of matchings, -factor-criticality…