Gexin Yu, Ph.D.
Affiliations: | 2006 | University of Illinois, Urbana-Champaign, Urbana-Champaign, IL |
Area:
MathematicsGoogle:
"Gexin Yu"Parents
Sign in to add mentor| Alexandr Kostochka | grad student | 2006 | UIUC | |
| (Extremal problems on linkage and packing in graphs.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Chen L, Huang M, Yu G, et al. (2020) The strong edge-coloring for graphs with small edge weight Discrete Mathematics. 343: 111779 |
| Kim S, Liu R, Yu G. (2020) Planar graphs without 7-cycles and butterflies are DP-4-colorable Discrete Mathematics. 343: 111714 |
| Li X, Yin Y, Yu G. (2020) Every planar graph without 5-cycles and K4− and adjacent 4-cycles is (2,0,0)-colorable Discrete Mathematics. 343: 111661 |
| Liu R, Yu G. (2020) Planar graphs without short even cycles are near-bipartite Discrete Applied Mathematics. 284: 626-630 |
| Liu R, Liu X, Rolek M, et al. (2020) Packing (1,1,2,2)-coloring of some subcubic graphs Discrete Applied Mathematics. 283: 626-630 |
| Liu R, Li X, Nakprasit K, et al. (2020) DP-4-colorability of planar graphs without adjacent cycles of given length Discrete Applied Mathematics. 277: 245-251 |
| Givens RM, Kincaid RK, Yu G. (2019) Open locating-dominating sets in circulant graphs Discussiones Mathematicae Graph Theory |
| Deng K, Yu G, Zhou X. (2019) Recent progress on strong edge-coloring of graphs Discrete Mathematics, Algorithms and Applications. 11: 1950062 |
| Liu R, Rolek M, Yu G. (2019) Minimum degree condition for a graph to be knitted Discrete Mathematics. 342: 3225-3228 |
| Choi I, Yu G, Zhang X. (2019) Planar graphs with girth at least 5 are (3,4)-colorable Discrete Mathematics. 342: 111577 |