On maximal (k, b)-linear-free sets of integers and its spectrum. - Lihua You; Gexin Yu; Bolian Liu (Australas. J Comb., 2001)

An extremal problem for H-linked graphs. - Alexandr V. Kostochka; Gexin Yu (J. Graph Theory, 2005)

On Sufficient Degree Conditions for a Graph to be k-linked. - Ken-ichi Kawarabayashi; Alexandr V. Kostochka; Gexin Yu (Comb. Probab. Comput., 2006)

Nowhere-zero Z3-flows through Z3-connectivity. - Matt DeVos; Rui Xu; Gexin Yu (Discret. Math., 2006)

On Minimum Degree Implying That a Graph is H-Linked. - Ronald J. Gould; Alexandr V. Kostochka; Gexin Yu (SIAM J. Discret. Math., 2006)

Ore-type graph packing problems. - Alexandr V. Kostochka; Gexin Yu (Comb. Probab. Comput., 2007)

An inequality for the group chromatic number of a graph. - Hong-Jian Lai; Xiangwen Li; Gexin Yu (Discret. Math., 2007)

An Ore-type analogue of the Sauer-Spencer Theorem. - Alexandr V. Kostochka; Gexin Yu (Graphs Comb., 2007)

On a graph packing conjecture by Bollobás, Eldridge and Catlin. - Hemanshu Kaul; Alexandr V. Kostochka; Gexin Yu (Comb., 2008)

Minimum degree conditions for H-linked graphs. - Alexandr V. Kostochka; Gexin Yu (Discret. Appl. Math., 2008)

Decomposing a planar graph with girth 9 into a forest and a matching. - Oleg V. Borodin; Alexandr V. Kostochka; Naeem N. Sheikh; Gexin Yu (Eur. J. Comb., 2008)

Ore-condition and Z3-connectivity. - Rong Luo; Rui Xu 023; Jianhua Yin; Gexin Yu (Eur. J. Comb., 2008)

Packing of graphs with small product of sizes. - Alexandr V. Kostochka; Gexin Yu (J. Comb. Theory B, 2008)

Ore-type degree conditions for a graph to be H-linked. - Alexandr V. Kostochka; Gexin Yu (J. Graph Theory, 2008)

On the First-Fit Chromatic Number of Graphs. - József Balogh; Stephen G. Hartke; Qi Liu; Gexin Yu (SIAM J. Discret. Math., 2008)

A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. - Daniel W. Cranston; Gexin Yu (Electron. J. Comb., 2009)

Hamiltonian connectedness in 3-connected line graphs. - Hong-Jian Lai; Yehong Shao; Gexin Yu; Mingquan Zhan (Discret. Appl. Math., 2009)

Ore-type conditions implying 2-factors consisting of short cycles. - Alexandr V. Kostochka; Gexin Yu (Discret. Math., 2009)

M-degrees of quadrangle-free planar graphs. - Oleg V. Borodin; Alexandr V. Kostochka; Naeem N. Sheikh; Gexin Yu (J. Graph Theory, 2009)

Implications among linkage properties in graphs. - Qi Liu 022; Douglas B. West; Gexin Yu (J. Graph Theory, 2009)

On the Pagenumber of k-Trees. - Jennifer Vandenbussche; Douglas B. West; Gexin Yu (SIAM J. Discret. Math., 2009)

Injective colorings of sparse graphs. - Daniel W. Cranston; Seog-Jin Kim; Gexin Yu (Discret. Math., 2010)

Equitable Coloring of Sparse Planar Graphs. - Rong Luo; Jean-Sébastien Sereni; D. Christopher Stephens; Gexin Yu (SIAM J. Discret. Math., 2010)

ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks. - Yifan Zhang 002; Qun Li 001; Gexin Yu; Baosheng Wang (INFOCOM, 2011)

Injective Colorings of Graphs with Low Average Degree. - Daniel W. Cranston; Seog-Jin Kim; Gexin Yu (Algorithmica, 2011)

Linear choosability of sparse graphs. - Daniel W. Cranston; Gexin Yu (Discret. Math., 2011)

Permutations as Product of Parallel Transpositions. - Chase Albert; Chi-Kwong Li; Gilbert Strang; Gexin Yu (SIAM J. Discret. Math., 2011)

Equitable defective coloring of sparse planar graphs. - Lee Williams; Jennifer Vandenbussche; Gexin Yu (Discret. Math., 2012)

An extremal problem on group connectivity of graphs. - Rong Luo; Rui Xu 023; Gexin Yu (Eur. J. Comb., 2012)

Graphs Containing Every 2-Factor. - Alexandr V. Kostochka; Gexin Yu (Graphs Comb., 2012)

Linkage for the diamond and the path with four vertices. - Mark N. Ellingham; Michael D. Plummer; Gexin Yu (J. Graph Theory, 2012)

New bounds on the minimum density of an identifying code for the infinite hexagonal grid. - Ari Cukierman; Gexin Yu (Discret. Appl. Math., 2013)

Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable. - Owen Hill; Diana Smith; Yingqian Wang 001; Lingji Xu; Gexin Yu (Discret. Math., 2013)

Linear colorings of subcubic graphs. - Chun-Hung Liu; Gexin Yu (Eur. J. Comb., 2013)

Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture. - Ken-ichi Kawarabayashi; Gexin Yu (J. Comb. Theory B, 2013)

A Relaxation of Steinberg's Conjecture. - Owen Hill; Gexin Yu (SIAM J. Discret. Math., 2013)

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. - Anke van Zuylen; James C. Bieron; Frans Schalekamp; Gexin Yu (CoRR, 2014)

Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks. - Yifan Zhang 002; Gexin Yu; Qun Li 001; Haodong Wang; Xiaojun Zhu 001; Baosheng Wang (IEEE/ACM Trans. Netw., 2014)

Optimal open-locating-dominating sets in infinite triangular grids. - Rex K. Kincaid; Allison Oldham; Gexin Yu (Discret. Appl. Math., 2015)

A relaxation of the Bordeaux Conjecture. - Runrun Liu; Xiangwen Li; Gexin Yu (Eur. J. Comb., 2015)

Strong edge-colorings for k-degenerate graphs. - Gexin Yu (Graphs Comb., 2015)

Extremal Permutations in Routing Cycles. - Jinhua He; Louis A. Valentin; Xiaoyan Yin 003; Gexin Yu (Electron. J. Comb., 2016)

Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. - Runrun Liu; Xiangwen Li; Gexin Yu (Discret. Math., 2016)

A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. - Anke van Zuylen; James C. Bieron; Frans Schalekamp; Gexin Yu (Inf. Process. Lett., 2016)

Mixed-weight open locating-dominating sets. - Robin M. Givens; Rex K. Kincaid; Weizhen Mao; Gexin Yu (CISS, 2017)

A Note on Chromatic Number and Induced Odd Cycles. - Baogang Xu; Gexin Yu; Xiaoya Zha (Electron. J. Comb., 2017)

The strong chromatic index of (3, Δ)-bipartite graphs. - Mingfang Huang; Gexin Yu; Xiangqian Zhou (Discret. Math., 2017)

Maximum average degree and relaxed coloring. - Michael Kopreski; Gexin Yu (Discret. Math., 2017)

Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable. - Ying Bai; Xiangwen Li; Gexin Yu (J. Comb. Optim., 2017)

An integer linear program for mixed-weight open locating-dominating sets. - Robin M. Givens; Rex K. Kincaid; Weizhen Mao; Gexin Yu (CISS, 2018)

Strong Chromatic Index of Graphs With Maximum Degree Four. - Mingfang Huang; Michael Santana; Gexin Yu (Electron. J. Comb., 2018)

On strong edge-coloring of graphs with maximum degree 4. - Jian-Bo Lv; Xiangwen Li; Gexin Yu (Discret. Appl. Math., 2018)

Strong list-chromatic index of subcubic graphs. - Tianjiao Dai; Guanghui Wang 002; Donglei Yang; Gexin Yu (Discret. Math., 2018)

Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable. - Heather Hoskins; Runrun Liu; Jennifer Vandenbussche; Gexin Yu (J. Comb. Optim., 2018)

A relaxation of the strong Bordeaux Conjecture. - Ziwen Huang; Xiangwen Li; Gexin Yu (J. Graph Theory, 2018)

Covering 2-connected 3-regular graphs with disjoint paths. - Gexin Yu (J. Graph Theory, 2018)

Strong edge-coloring for planar graphs with large girth. - Lily Chen; Kecai Deng; Gexin Yu; Xiangqian Zhou (Discret. Math., 2019)

DP-4-colorability of two classes of planar graphs. - Lily Chen; Runrun Liu; Gexin Yu; Ren Zhao; Xiangqian Zhou (Discret. Math., 2019)

Planar graphs with girth at least 5 are (3, 4)-colorable. - Ilkyoo Choi; Gexin Yu; Xia Zhang (Discret. Math., 2019)

DP-3-coloring of some planar graphs. - Runrun Liu; Sarah Loeb; Yuxue Yin; Gexin Yu (Discret. Math., 2019)

Minimum degree condition for a graph to be knitted. - Runrun Liu; Martin Rolek; Gexin Yu (Discret. Math., 2019)

Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable. - Yuxue Yin; Gexin Yu (Discret. Math., 2019)

Recent progress on strong edge-coloring of graphs. - Kecai Deng; Gexin Yu; Xiangqian Zhou (Discret. Math. Algorithms Appl., 2019)

DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}. - Runrun Liu; Sarah Loeb; Martin Rolek; Yuxue Yin; Gexin Yu (Graphs Comb., 2019)

DP-4-colorability of planar graphs without adjacent cycles of given length. - Runrun Liu; Xiangwen Li; Kittikorn Nakprasit; Pongpat Sittitrai; Gexin Yu (Discret. Appl. Math., 2020)

Packing (1, 1, 2, 2)-coloring of some subcubic graphs. - Runrun Liu; Xujun Liu; Martin Rolek; Gexin Yu (Discret. Appl. Math., 2020)

Planar graphs without short even cycles are near-bipartite. - Runrun Liu; Gexin Yu (Discret. Appl. Math., 2020)

The strong edge-coloring for graphs with small edge weight. - Lily Chen; Mingfang Huang; Gexin Yu; Xiangqian Zhou (Discret. Math., 2020)

Planar graphs without 7-cycles and butterflies are DP-4-colorable. - Seog-Jin Kim; Runrun Liu; Gexin Yu (Discret. Math., 2020)

Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable. - Xiangwen Li; Yuxue Yin; Gexin Yu (Discret. Math., 2020)

Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. - Xiangwen Li; Runrun Liu; Gexin Yu (Discret. Appl. Math., 2021)

An improved linear connectivity bound for tournaments to be highly linked. - Wei Meng; Martin Rolek; Yue Wang 050; Gexin Yu (Eur. J. Comb., 2021)

Sufficient Conditions for 2-Dimensional Global Rigidity. - Xiaofeng Gu 002; Wei Meng; Martin Rolek; Yue Wang 050; Gexin Yu (SIAM J. Discret. Math., 2021)

Connectivity for Kite-Linked Graphs. - Runrun Liu; Martin Rolek; D. Christopher Stephens; Dong Ye 002; Gexin Yu (SIAM J. Discret. Math., 2021)

Note on injective edge-coloring of graphs. - Zhengke Miao; Yimin Song; Gexin Yu (Discret. Appl. Math., 2022)

Partition graphs of independence number 2 into two subgraphs with large chromatic numbers. - Yue Wang 050; Gexin Yu (Discret. Math., 2022)

Open locating-dominating sets in circulant graphs. - Robin M. Givens; Gexin Yu; Rex K. Kincaid (Discuss. Math. Graph Theory, 2022)

Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs. - Yue Wang 050; Gexin Yu (J. Graph Theory, 2022)

Spanning tree packing and 2-essential edge-connectivity. - Xiaofeng Gu 002; Runrun Liu; Gexin Yu (Discret. Math., 2023)

Optimal connectivity for fat-triangle linkages. - Runrun Liu; Martin Rolek; Gexin Yu (Discret. Math., 2023)

1-planar graphs are odd 13-colorable. - Runrun Liu; Weifan Wang 001; Gexin Yu (Discret. Math., 2023)

Strong edge-coloring of 2-degenerate graphs. - Gexin Yu; Rachel Yu (Discret. Appl. Math., 2023)

Cliques in squares of graphs with maximum average degree less than 4. - Daniel W. Cranston; Gexin Yu (J. Graph Theory, 2024)