Gexin Yu

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 41

Top Topics

Cognitive Radio

Top Venues

Discret. Appl. Math.

SIAM J. Discret. Math.

J. Graph Theory

Publications

Runrun Liu, Weifan Wang, Gexin Yu
1-planar graphs are odd 13-colorable. Discret. Math. 346 (8) (2023)
Xiaofeng Gu, Runrun Liu, Gexin Yu
Spanning tree packing and 2-essential edge-connectivity. Discret. Math. 346 (1) (2023)
Gexin Yu, Rachel Yu
Strong edge-coloring of 2-degenerate graphs. Discret. Appl. Math. 336 (2023)
Runrun Liu, Martin Rolek, Gexin Yu
Optimal connectivity for fat-triangle linkages. Discret. Math. 346 (5) (2023)
Yue Wang, Gexin Yu
Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs. J. Graph Theory 101 (1) (2022)
Robin M. Givens, Gexin Yu, Rex K. Kincaid
Open locating-dominating sets in circulant graphs. Discuss. Math. Graph Theory 42 (1) (2022)
Zhengke Miao, Yimin Song, Gexin Yu
Note on injective edge-coloring of graphs. Discret. Appl. Math. 310 (2022)
Yue Wang, Gexin Yu
Partition graphs of independence number 2 into two subgraphs with large chromatic numbers. Discret. Math. 345 (4) (2022)
Xiaofeng Gu, Wei Meng, Martin Rolek, Yue Wang, Gexin Yu
Sufficient Conditions for 2-Dimensional Global Rigidity. SIAM J. Discret. Math. 35 (4) (2021)
Wei Meng, Martin Rolek, Yue Wang, Gexin Yu
An improved linear connectivity bound for tournaments to be highly linked. Eur. J. Comb. 98 (2021)
Xiangwen Li, Runrun Liu, Gexin Yu
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Appl. Math. 304 (2021)
Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu
Connectivity for Kite-Linked Graphs. SIAM J. Discret. Math. 35 (1) (2021)
Lily Chen, Mingfang Huang, Gexin Yu, Xiangqian Zhou
The strong edge-coloring for graphs with small edge weight. Discret. Math. 343 (4) (2020)
Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. 283 (2020)
Seog-Jin Kim, Runrun Liu, Gexin Yu
Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discret. Math. 343 (8) (2020)
Xiangwen Li, Yuxue Yin, Gexin Yu
Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable. Discret. Math. 343 (2) (2020)
Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu
DP-4-colorability of planar graphs without adjacent cycles of given length. Discret. Appl. Math. 277 (2020)
Runrun Liu, Gexin Yu
Planar graphs without short even cycles are near-bipartite. Discret. Appl. Math. 284 (2020)
Runrun Liu, Martin Rolek, Gexin Yu
Minimum degree condition for a graph to be knitted. Discret. Math. 342 (11) (2019)
Ilkyoo Choi, Gexin Yu, Xia Zhang
Planar graphs with girth at least 5 are (3, 4)-colorable. Discret. Math. 342 (12) (2019)
Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu
DP-3-coloring of some planar graphs. Discret. Math. 342 (1) (2019)
Lily Chen, Kecai Deng, Gexin Yu, Xiangqian Zhou
Strong edge-coloring for planar graphs with large girth. Discret. Math. 342 (2) (2019)
Runrun Liu, Sarah Loeb, Martin Rolek, Yuxue Yin, Gexin Yu
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}. Graphs Comb. 35 (3) (2019)
Kecai Deng, Gexin Yu, Xiangqian Zhou
Recent progress on strong edge-coloring of graphs. Discret. Math. Algorithms Appl. 11 (5) (2019)
Yuxue Yin, Gexin Yu
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable. Discret. Math. 342 (8) (2019)
Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou
DP-4-colorability of two classes of planar graphs. Discret. Math. 342 (11) (2019)
Mingfang Huang, Michael Santana, Gexin Yu
Strong Chromatic Index of Graphs With Maximum Degree Four. Electron. J. Comb. 25 (3) (2018)
Tianjiao Dai, Guanghui Wang, Donglei Yang, Gexin Yu
Strong list-chromatic index of subcubic graphs. Discret. Math. 341 (12) (2018)
Gexin Yu
Covering 2-connected 3-regular graphs with disjoint paths. J. Graph Theory 88 (3) (2018)
Jian-Bo Lv, Xiangwen Li, Gexin Yu
On strong edge-coloring of graphs with maximum degree 4. Discret. Appl. Math. 235 (2018)
Robin M. Givens, Rex K. Kincaid, Weizhen Mao, Gexin Yu
An integer linear program for mixed-weight open locating-dominating sets. CISS (2018)
Heather Hoskins, Runrun Liu, Jennifer Vandenbussche, Gexin Yu
Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable. J. Comb. Optim. 36 (2) (2018)
Ziwen Huang, Xiangwen Li, Gexin Yu
A relaxation of the strong Bordeaux Conjecture. J. Graph Theory 88 (2) (2018)
Baogang Xu, Gexin Yu, Xiaoya Zha
A Note on Chromatic Number and Induced Odd Cycles. Electron. J. Comb. 24 (4) (2017)
Robin M. Givens, Rex K. Kincaid, Weizhen Mao, Gexin Yu
Mixed-weight open locating-dominating sets. CISS (2017)
Michael Kopreski, Gexin Yu
Maximum average degree and relaxed coloring. Discret. Math. 340 (10) (2017)
Mingfang Huang, Gexin Yu, Xiangqian Zhou
The strong chromatic index of (3, Δ)-bipartite graphs. Discret. Math. 340 (5) (2017)
Ying Bai, Xiangwen Li, Gexin Yu
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable. J. Comb. Optim. 33 (4) (2017)
Jinhua He, Louis A. Valentin, Xiaoyan Yin, Gexin Yu
Extremal Permutations in Routing Cycles. Electron. J. Comb. 23 (3) (2016)
Runrun Liu, Xiangwen Li, Gexin Yu
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Math. 339 (2) (2016)
Anke van Zuylen, James Bieron, Frans Schalekamp, Gexin Yu
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation. Inf. Process. Lett. 116 (11) (2016)
Runrun Liu, Xiangwen Li, Gexin Yu
A relaxation of the Bordeaux Conjecture. Eur. J. Comb. 49 (2015)
Gexin Yu
Strong edge-colorings for k-degenerate graphs. Graphs Comb. 31 (5) (2015)
Rex K. Kincaid, Allison Oldham, Gexin Yu
Optimal open-locating-dominating sets in infinite triangular grids. Discret. Appl. Math. 193 (2015)
Anke van Zuylen, James Bieron, Frans Schalekamp, Gexin Yu
An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. CoRR (2014)
Yifan Zhang, Gexin Yu, Qun Li, Haodong Wang, Xiaojun Zhu, Baosheng Wang
Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks. IEEE/ACM Trans. Netw. 22 (3) (2014)
Chun-Hung Liu, Gexin Yu
Linear colorings of subcubic graphs. Eur. J. Comb. 34 (6) (2013)
Owen Hill, Diana Smith, Yingqian Wang, Lingji Xu, Gexin Yu
Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable. Discret. Math. 313 (20) (2013)
Owen Hill, Gexin Yu
A Relaxation of Steinberg's Conjecture. SIAM J. Discret. Math. 27 (1) (2013)
Ari Cukierman, Gexin Yu
New bounds on the minimum density of an identifying code for the infinite hexagonal grid. Discret. Appl. Math. 161 (18) (2013)
Ken-ichi Kawarabayashi, Gexin Yu
Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory, Ser. B 103 (3) (2013)
Rong Luo, Rui Xu, Gexin Yu
An extremal problem on group connectivity of graphs. Eur. J. Comb. 33 (6) (2012)
Lee Williams, Jennifer Vandenbussche, Gexin Yu
Equitable defective coloring of sparse planar graphs. Discret. Math. 312 (5) (2012)
Alexandr V. Kostochka, Gexin Yu
Graphs Containing Every 2-Factor. Graphs Comb. 28 (5) (2012)
Mark N. Ellingham, Michael D. Plummer, Gexin Yu
Linkage for the diamond and the path with four vertices. J. Graph Theory 70 (3) (2012)
Chun-Hung Liu, Gexin Yu
Linear colorings of subcubic graphs CoRR (2012)
Chase Albert, Chi-Kwong Li, Gilbert Strang, Gexin Yu
Permutations as Product of Parallel Transpositions. SIAM J. Discret. Math. 25 (3) (2011)
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
Injective Colorings of Graphs with Low Average Degree. Algorithmica 60 (3) (2011)
Daniel W. Cranston, Gexin Yu
Linear choosability of sparse graphs. Discret. Math. 311 (17) (2011)
Yifan Zhang, Qun Li, Gexin Yu, Baosheng Wang
ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks. INFOCOM (2011)
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
Injective colorings of graphs with low average degree CoRR (2010)
Daniel W. Cranston, Gexin Yu
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid CoRR (2010)
Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu
Equitable Coloring of Sparse Planar Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
Injective colorings of sparse graphs. Discret. Math. 310 (21) (2010)
Alexandr V. Kostochka, Gexin Yu
Ore-type conditions implying 2-factors consisting of short cycles. Discret. Math. 309 (14) (2009)
Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan
Hamiltonian connectedness in 3-connected line graphs. Discret. Appl. Math. 157 (5) (2009)
Qi Liu, Douglas B. West, Gexin Yu
Implications among linkage properties in graphs. J. Graph Theory 60 (4) (2009)
Daniel W. Cranston, Gexin Yu
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. Electron. J. Comb. 16 (1) (2009)
Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu
-degrees of quadrangle-free planar graphs. J. Graph Theory 60 (1) (2009)
Jennifer Vandenbussche, Douglas B. West, Gexin Yu
On the Pagenumber of k-Trees. SIAM J. Discret. Math. 23 (3) (2009)
Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu
Decomposing a planar graph with girth 9 into a forest and a matching. Eur. J. Comb. 29 (5) (2008)
Alexandr V. Kostochka, Gexin Yu
Packing of graphs with small product of sizes. J. Comb. Theory, Ser. B 98 (6) (2008)
Rong Luo, Rui Xu, Jianhua Yin, Gexin Yu
-connectivity. Eur. J. Comb. 29 (7) (2008)
József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu
On the First-Fit Chromatic Number of Graphs. SIAM J. Discret. Math. 22 (3) (2008)
Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Comb. 28 (4) (2008)
Alexandr V. Kostochka, Gexin Yu
-linked. J. Graph Theory 58 (1) (2008)
Alexandr V. Kostochka, Gexin Yu
Minimum degree conditions for H-linked graphs. Discret. Appl. Math. 156 (9) (2008)
Alexandr V. Kostochka, Gexin Yu
Ore-type graph packing problems. Comb. Probab. Comput. 16 (1) (2007)
Alexandr V. Kostochka, Gexin Yu
An Ore-type analogue of the Sauer-Spencer Theorem. Graphs Comb. 23 (4) (2007)
Hong-Jian Lai, Xiangwen Li, Gexin Yu
An inequality for the group chromatic number of a graph. Discret. Math. 307 (23) (2007)
Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu
On Sufficient Degree Conditions for a Graph to be k-linked. Comb. Probab. Comput. 15 (5) (2006)
Matt DeVos, Rui Xu, Gexin Yu
-connectivity. Discret. Math. 306 (1) (2006)
Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu
On Minimum Degree Implying That a Graph is H-Linked. SIAM J. Discret. Math. 20 (4) (2006)
Alexandr V. Kostochka, Gexin Yu
-linked graphs. J. Graph Theory 50 (4) (2005)
Alexandr V. Kostochka, Gexin Yu
Minimum degree conditions for H-linked graphs. Electron. Notes Discret. Math. 21 (2005)
Lihua You, Gexin Yu, Bolian Liu
On maximal (k, b)-linear-free sets of integers and its spectrum. Australas. J Comb. 23 (2001)