Gexin Yu

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