Gexin Yu

most citedStrong edge-colorings for k-degenerate graphs

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

collaborators

3 papers

math.CO2012

Perfect partition of some regular bipartite graphs

Chi-Kwong Li, Jeff Soosiah, Gexin Yu

A graph has a perfect partition if all its perfect matchings can be partitioned so that each part is a 1-factorization of the graph. Let $L_{r m, r} = K_{r m, r m} - m K_{r, r}$ . We first gi…

math.CO2012★ 7 cited

Strong edge-colorings for k-degenerate graphs

Gexin Yu

We prove that the strong chromatic index for each $k$ -degenerate graph with maximum degree $Δ$ is at most $(4 k - 2) Δ - k (2 k - 1) + 1$ .

math.CO2012

A relaxation of Steinberg's Conjecture

Owen Hill, Gexin Yu

A graph is $(c_{1}, c_{2}, ..., c_{k})$ -colorable if the vertex set can be partitioned into $k$ sets $V_{1}, V_{2}, ..., V_{k}$ , such that for every $i : 1 \leq i \leq k$ the subgraph $G [V_{i}]$ has…