According to our database
1,
Gexin Yu
authored at least 82 papers
between 2001 and 2023.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2023
Strong edge-coloring of 2-degenerate graphs.
Discret. Appl. Math., September, 2023
1-planar graphs are odd 13-colorable.
Discret. Math., August, 2023
Optimal connectivity for fat-triangle linkages.
Discret. Math., May, 2023
Spanning tree packing and 2-essential edge-connectivity.
Discret. Math., 2023
2022
Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs.
J. Graph Theory, 2022
Open locating-dominating sets in circulant graphs.
Discuss. Math. Graph Theory, 2022
Partition graphs of independence number 2 into two subgraphs with large chromatic numbers.
Discret. Math., 2022
Note on injective edge-coloring of graphs.
Discret. Appl. Math., 2022
2021
Connectivity for Kite-Linked Graphs.
SIAM J. Discret. Math., 2021
Sufficient Conditions for 2-Dimensional Global Rigidity.
SIAM J. Discret. Math., 2021
An improved linear connectivity bound for tournaments to be highly linked.
Eur. J. Comb., 2021
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable.
Discret. Appl. Math., 2021
2020
Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable.
Discret. Math., 2020
Planar graphs without 7-cycles and butterflies are DP-4-colorable.
Discret. Math., 2020
The strong edge-coloring for graphs with small edge weight.
Discret. Math., 2020
Planar graphs without short even cycles are near-bipartite.
Discret. Appl. Math., 2020
Packing (1, 1, 2, 2)-coloring of some subcubic graphs.
Discret. Appl. Math., 2020
DP-4-colorability of planar graphs without adjacent cycles of given length.
Discret. Appl. Math., 2020
2019
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}.
Graphs Comb., 2019
Recent progress on strong edge-coloring of graphs.
Discret. Math. Algorithms Appl., 2019
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable.
Discret. Math., 2019
Minimum degree condition for a graph to be knitted.
Discret. Math., 2019
DP-3-coloring of some planar graphs.
Discret. Math., 2019
Planar graphs with girth at least 5 are (3, 4)-colorable.
Discret. Math., 2019
DP-4-colorability of two classes of planar graphs.
Discret. Math., 2019
Strong edge-coloring for planar graphs with large girth.
Discret. Math., 2019
2018
Covering 2-connected 3-regular graphs with disjoint paths.
J. Graph Theory, 2018
A relaxation of the strong Bordeaux Conjecture.
J. Graph Theory, 2018
Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable.
J. Comb. Optim., 2018
Strong list-chromatic index of subcubic graphs.
Discret. Math., 2018
On strong edge-coloring of graphs with maximum degree 4.
Discret. Appl. Math., 2018
Strong Chromatic Index of Graphs With Maximum Degree Four.
Electron. J. Comb., 2018
An integer linear program for mixed-weight open locating-dominating sets.
Proceedings of the 52nd Annual Conference on Information Sciences and Systems, 2018
2017
Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable.
J. Comb. Optim., 2017
Maximum average degree and relaxed coloring.
Discret. Math., 2017
The strong chromatic index of (3, Δ)-bipartite graphs.
Discret. Math., 2017
A Note on Chromatic Number and Induced Odd Cycles.
Electron. J. Comb., 2017
Mixed-weight open locating-dominating sets.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017
2016
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation.
Inf. Process. Lett., 2016
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable.
Discret. Math., 2016
Extremal Permutations in Routing Cycles.
Electron. J. Comb., 2016
2015
Strong edge-colorings for k-degenerate graphs.
Graphs Comb., 2015
A relaxation of the Bordeaux Conjecture.
Eur. J. Comb., 2015
Optimal open-locating-dominating sets in infinite triangular grids.
Discret. Appl. Math., 2015
2014
Channel-Hopping-Based Communication Rendezvous in Cognitive Radio Networks.
IEEE/ACM Trans. Netw., 2014
An Upper Bound on the Number of Circular Transpositions to Sort a Permutation.
CoRR, 2014
2013
A Relaxation of Steinberg's Conjecture.
SIAM J. Discret. Math., 2013
Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture.
J. Comb. Theory, Ser. B, 2013
Linear colorings of subcubic graphs.
Eur. J. Comb., 2013
Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable.
Discret. Math., 2013
New bounds on the minimum density of an identifying code for the infinite hexagonal grid.
Discret. Appl. Math., 2013
2012
Linkage for the diamond and the path with four vertices.
J. Graph Theory, 2012
Graphs Containing Every 2-Factor.
Graphs Comb., 2012
An extremal problem on group connectivity of graphs.
Eur. J. Comb., 2012
Equitable defective coloring of sparse planar graphs.
Discret. Math., 2012
2011
Permutations as Product of Parallel Transpositions.
SIAM J. Discret. Math., 2011
Linear choosability of sparse graphs.
Discret. Math., 2011
Injective Colorings of Graphs with Low Average Degree.
Algorithmica, 2011
ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks.
Proceedings of the INFOCOM 2011. 30th IEEE International Conference on Computer Communications, 2011
2010
Equitable Coloring of Sparse Planar Graphs.
SIAM J. Discret. Math., 2010
Injective colorings of sparse graphs.
Discret. Math., 2010
2009
On the Pagenumber of k-Trees.
SIAM J. Discret. Math., 2009
Implications among linkage properties in graphs.
J. Graph Theory, 2009
<i>M</i>-degrees of quadrangle-free planar graphs.
J. Graph Theory, 2009
Ore-type conditions implying 2-factors consisting of short cycles.
Discret. Math., 2009
Hamiltonian connectedness in 3-connected line graphs.
Discret. Appl. Math., 2009
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid.
Electron. J. Comb., 2009
2008
On the First-Fit Chromatic Number of Graphs.
SIAM J. Discret. Math., 2008
Ore-type degree conditions for a graph to be <i>H</i>-linked.
J. Graph Theory, 2008
Packing of graphs with small product of sizes.
J. Comb. Theory, Ser. B, 2008
Ore-condition and Z<sub>3</sub>-connectivity.
Eur. J. Comb., 2008
Decomposing a planar graph with girth 9 into a forest and a matching.
Eur. J. Comb., 2008
On a graph packing conjecture by Bollobás, Eldridge and Catlin.
Comb., 2008
2007
An Ore-type analogue of the Sauer-Spencer Theorem.
Graphs Comb., 2007
An inequality for the group chromatic number of a graph.
Discret. Math., 2007
Ore-type graph packing problems.
Comb. Probab. Comput., 2007
2006
On Minimum Degree Implying That a Graph is H-Linked.
SIAM J. Discret. Math., 2006
Nowhere-zero <i>Z</i><sub>3</sub>-flows through <i>Z</i><sub>3</sub>-connectivity.
Discret. Math., 2006
On Sufficient Degree Conditions for a Graph to be k-linked.
Comb. Probab. Comput., 2006
2005
An extremal problem for <i>H</i>-linked graphs.
J. Graph Theory, 2005
Minimum degree conditions for H-linked graphs.
Electron. Notes Discret. Math., 2005
2001
On maximal (k, b)-linear-free sets of integers and its spectrum.
Australas. J Comb., 2001
