Jinjiang Yuan

most citedA note on Matching Cover Algorithm

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

collaborators

3 papers

math.CO2023

Properly colored even cycles in edge-colored complete balanced bipartite graphs

Shanshan Guo, Fei Huang, Jinjiang Yuan +2

Consider a complete balanced bipartite graph $K_{n, n}$ and let $K_{n, n}^{c}$ be an edge-colored version of $K_{n, n}$ that is obtained from $K_{n, n}$ by having each edge assigned a ce…

math.CO2023★ 1 cited

Sufficient conditions for $k$ -factors and spanning trees of graphs

Guoyan Ao, Ruifang Liu, Jinjiang Yuan +2

For any integer $k \geq 1,$ a graph $G$ has a $k$ -factor if it contains a $k$ -regular spanning subgraph. In this paper we prove a sufficient condition in terms of the number of $r$ -c…

math.CO2016★ 1 cited

A note on Matching Cover Algorithm

Xiumei Wang, Xiaoxin Song, Jinjiang Yuan

A $k$ -matching cover of a graph $G$ is a union of $k$ matchings of $G$ which covers $V (G)$ . A matching cover of $G$ is optimal if it consists of the fewest matchings of $G$ . In thi…

Properly colored even cycles in edge-colored complete balanced bipartite graphs

Sufficient conditions for k-factors and spanning trees of graphs

A note on Matching Cover Algorithm

Sufficient conditions for $k$ -factors and spanning trees of graphs