Gexin Yu

发表

An inequality for the group chromatic number of a graph

Hong-Jian Lai, Xiangwen Li, Gexin Yu, 2007, Discret. Math..

Linear colorings of subcubic graphs pdf

Chun-Hung Liu, Gexin Yu, Gexin Yu, 2012, Eur. J. Comb..

A Relaxation of Steinberg's Conjecture

Gexin Yu, Owen Hill, Gexin Yu, 2012, SIAM J. Discret. Math..

Permutations as Product of Parallel Transpositions

Chi-Kwong Li, Gexin Yu, Gilbert Strang, 2011, SIAM J. Discret. Math..

An Upper Bound on the Number of Circular Transpositions to Sort a Permutation pdf

Gexin Yu, Anke van Zuylen, Frans Schalekamp, 2014, ArXiv.

A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid

Daniel W. Cranston, Gexin Yu, Gexin Yu, 2009, Electron. J. Comb..

Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks

Baosheng Wang, Qun Li, Haodong Wang, 2014, IEEE/ACM Transactions on Networking.

An integer linear program for mixed-weight open locating-dominating sets

Rex K. Kincaid, Weizhen Mao, Gexin Yu, 2018, 2018 52nd Annual Conference on Information Sciences and Systems (CISS).

Minimum degree condition for a graph to be knitted

Gexin Yu, Runrun Liu, Martin Rolek, 2018, Discret. Math..

Planar graphs without short even cycles are near-bipartite

Gexin Yu, Runrun Liu, 2020, Discret. Appl. Math..

ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks

Baosheng Wang, Qun Li, Gexin Yu, 2011, 2011 Proceedings IEEE INFOCOM.

Graphs Containing Every 2-Factor

Alexandr V. Kostochka, Gexin Yu, A. Kostochka, 2012, Graphs Comb..

A relaxation of the Bordeaux Conjecture

Xiangwen Li, Gexin Yu, Runrun Liu, 2014, Eur. J. Comb..

An extremal problem on group connectivity of graphs

Rong Luo, Rui Xu, Gexin Yu, 2012, Eur. J. Comb..

Packing of graphs with small product of sizes

Alexandr V. Kostochka, Gexin Yu, 2008, J. Comb. Theory, Ser. B.

Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable

Gexin Yu, Yuxue Yin, Gexin Yu, 2018, Discret. Math..

Planar graphs with girth at least 5 are (3, 4)-colorable

Gexin Yu, Xia Zhang, Ilkyoo Choi, 2019, Discret. Math..

Recent progress on strong edge-coloring of graphs

Gexin Yu, Kecai Deng, Xiangqian Zhou, 2019, Discret. Math. Algorithms Appl..

Injective colorings of sparse graphs

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu, 2010, Discret. Math..

Ore-condition and Z3-connectivity

Rong Luo, Rui Xu, Jianhua Yin, 2008, Eur. J. Comb..

M-degrees of quadrangle-free planar graphs

Alexandr V. Kostochka, Gexin Yu, Oleg V. Borodin, 2009, J. Graph Theory.

Ore‐type degree conditions for a graph to be H‐linked

Alexandr V. Kostochka, Gexin Yu, A. Kostochka, 2008, J. Graph Theory.

On maximal (k, b)-linear-free sets of integers and its spectrum

Bolian Liu, Lihua You, Gexin Yu, 2001, Australas. J Comb..

Strong Chromatic Index of Graphs With Maximum Degree Four

Gexin Yu, Mingfang Huang, Michael Santana, 2018, Electron. J. Comb..

An Ore-type analogue of the Sauer-Spencer Theorem

Alexandr V. Kostochka, Gexin Yu, A. Kostochka, 2007, Graphs Comb..

Hamiltonian connectedness in 3-connected line graphs

Hong-Jian Lai, Gexin Yu, Mingquan Zhan, 2009, Discret. Appl. Math..

A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation

Gexin Yu, Anke van Zuylen, Frans Schalekamp, 2016, Inf. Process. Lett..

On the Pagenumber of k-Trees

Douglas B. West, Gexin Yu, Jennifer Vandenbussche, 2009, SIAM J. Discret. Math..

Planar graphs without 7-cycles and butterflies are DP-4-colorable

Seog-Jin Kim, Gexin Yu, Runrun Liu, 2020, Discret. Math..

Minimum degree conditions for H-linked graphs

Alexandr V. Kostochka, Gexin Yu, A. Kostochka, 2005, Discret. Appl. Math..

Decomposing a planar graph with girth 9 into a forest and a matching

Alexandr V. Kostochka, Gexin Yu, Oleg V. Borodin, 2008, Eur. J. Comb..

Mixed-weight open locating-dominating sets

Rex K. Kincaid, Weizhen Mao, Gexin Yu, 2017, 2017 51st Annual Conference on Information Sciences and Systems (CISS).

Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable

Xiangwen Li, Gexin Yu, Yuxue Yin, 2020, Discret. Math..

Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture

Ken-ichi Kawarabayashi, Gexin Yu, 2013, J. Comb. Theory, Ser. B.

On a graph packing conjecture by Bollobás, Eldridge and Catlin

Alexandr V. Kostochka, Gexin Yu, Hemanshu Kaul, 2008, Comb..

On Sufficient Degree Conditions for a Graph to be $k$-linked

Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu, 2006, Combinatorics, Probability and Computing.

Ore-type conditions implying 2-factors consisting of short cycles

Alexandr V. Kostochka, Gexin Yu, A. Kostochka, 2009, Discret. Math..

Optimal open-locating-dominating sets in infinite triangular grids

Rex K. Kincaid, Gexin Yu, Allison Oldham, 2014, Discret. Appl. Math..

On Minimum Degree Implying That a Graph is H-Linked

Alexandr V. Kostochka, Gexin Yu, Ronald J. Gould, 2006, SIAM J. Discret. Math..

Equitable Coloring of Sparse Planar Graphs

Jean-Sébastien Sereni, Rong Luo, Gexin Yu, 2010, SIAM J. Discret. Math..

Ore-type graph packing problems

Alexandr V. Kostochka, Gexin Yu, A. Kostochka, 2006, Combinatorics, Probability and Computing.

An extremal problem for H‐linked graphs

Alexandr V. Kostochka, Gexin Yu, A. Kostochka, 2005, J. Graph Theory.

Linear choosability of sparse graphs

Daniel W. Cranston, Gexin Yu, 2011, Discret. Math..

Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable

Gexin Yu, Jennifer Vandenbussche, Runrun Liu, 2018, J. Comb. Optim..

Strong list-chromatic index of subcubic graphs

Guanghui Wang, Gexin Yu, Donglei Yang, 2018, Discret. Math..

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, 2017, J. Comb. Optim..

Strong edge-coloring for planar graphs with large girth

Lily Chen, Xiangqian Zhou, Gexin Yu, 2019, Discret. Math..

Strong edge-colorings for $$k$$k-degenerate graphs

Gexin Yu, Gexin Yu, 2012, Graphs Comb..

Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable

Xiangwen Li, Gexin Yu, Runrun Liu, 2014, Discret. Math..

Equitable defective coloring of sparse planar graphs

Gexin Yu, Jennifer Vandenbussche, Lee Williams, 2012, Discret. Math..

Minimum degree conditions for H-linked graphs

Alexandr V. Kostochka, Gexin Yu, 2008, Discret. Appl. Math..

The strong edge-coloring for graphs with small edge weight

Xiangqian Zhou, Gexin Yu, Mingfang Huang, 2020, Discret. Math..

Linkage for the diamond and the path with four vertices

Michael D. Plummer, Gexin Yu, Mark N. Ellingham, 2012, J. Graph Theory.

Packing (1, 1, 2, 2)-coloring of some subcubic graphs

Gexin Yu, Runrun Liu, Martin Rolek, 2020, Discret. Appl. Math..

Implications among linkage properties in graphs

Qi Liu, Douglas B. West, Gexin Yu, 2009, J. Graph Theory.

Covering 2‐connected 3‐regular graphs with disjoint paths

Gexin Yu, Gexin Yu, 2018, J. Graph Theory.

The strong chromatic index of (3, Δ)-bipartite graphs

Xiangqian Zhou, Gexin Yu, Mingfang Huang, 2017, Discret. Math..

On the First-Fit Chromatic Number of Graphs

Qi Liu, József Balogh, Stephen G. Hartke, 2008, SIAM J. Discret. Math..

DP-3-coloring of some planar graphs

Gexin Yu, Runrun Liu, Yuxue Yin, 2018, Discret. Math..

Injective Colorings of Graphs with Low Average Degree

Daniel W. Cranston, Seog-Jin Kim, Gexin Yu, 2010, Algorithmica.

DP-4-colorability of two classes of planar graphs

Lily Chen, Ren Zhao, Xiangqian Zhou, 2019, Discret. Math..

DP-4-colorability of planar graphs without adjacent cycles of given length

Xiangwen Li, Gexin Yu, Kittikorn Nakprasit, 2020, Discret. Appl. Math..

A relaxation of the strong Bordeaux Conjecture

Xiangwen Li, Gexin Yu, Ziwen Huang, 2018, J. Graph Theory.

On strong edge-coloring of graphs with maximum degree 4

Xiangwen Li, Gexin Yu, Jian-Bo Lv, 2018, Discret. Appl. Math..

Extremal Permutations in Routing Cycles

Gexin Yu, Xiaoyan Yin, Jinhua He, 2016, Electron. J. Comb..

DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from $$\{6,7,8\}$${6,7,8}

Gexin Yu, Runrun Liu, Martin Rolek, 2019, Graphs Comb..

New bounds on the minimum density of an identifying code for the infinite hexagonal grid

Gexin Yu, Ari Cukierman, A. Cukierman, 2013, Discret. Appl. Math..

Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable

Yingqian Wang, Gexin Yu, Lingji Xu, 2013, Discret. Math..

A Note on Chromatic Number and Induced Odd Cycles

Baogang Xu, Gexin Yu, Xiaoya Zha, 2017, Electron. J. Comb..

Maximum average degree and relaxed coloring

Gexin Yu, Michael Kopreski, 2017, Discret. Math..

Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable

Gexin Yu, Runrun Liu, Xiangwen Li, 2021, Discret. Appl. Math..

Connectivity for Kite-Linked Graphs

Gexin Yu, Dong Ye, D. Christopher Stephens, 2019, SIAM J. Discret. Math..

Sufficient Conditions for 2-Dimensional Global Rigidity

Wei Meng, Gexin Yu, Martin Rolek, 2021, SIAM J. Discret. Math..

An improved linear connectivity bound for tournaments to be highly linked

Wei Meng, Gexin Yu, Martin Rolek, 2021, Eur. J. Comb..

Open Locating-Dominating Sets in Circulant Graphs

Rex K. Kincaid, Gexin Yu, Robin M. Givens, 2022, Discuss. Math. Graph Theory.

An extremal problem for H -linked graphs

Alexandr V. Kostochka, Gexin Yu, A. Kostochka, 2005 .

Surveys in Combinatorics 2009: Extremal graph packing problems: Ore-type versus Dirac-type

Alexandr V. Kostochka, Gexin Yu, H. A. Kierstead, 2009 .

DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$.

Gexin Yu, Runrun Liu, Martin Rolek, 2018 .

M-degrees of quadrangle-free planar graphs

Alexandr V. Kostochka, Gexin Yu, Oleg V. Borodin, 2009 .

Nowhere-zero Z3-flows through Z3-connectivity

Matt DeVos, Gexin Yu, Rui Xu, 2006, Discret. Math..

A note on strong edge-colorings of 2-degenerate graphs

Gexin Yu, Rong Luo, Gexin Yu, 2012, 1212.6092.