default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGexin Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j80]Daniel W. Cranston
, Gexin Yu:
Cliques in squares of graphs with maximum average degree less than 4. J. Graph Theory 107(3): 559-577 (2024)- 2023
- [j79]Gexin Yu, Rachel Yu:
Strong edge-coloring of 2-degenerate graphs. Discret. Appl. Math. 336: 11-14 (2023) - [j78]Xiaofeng Gu, Runrun Liu, Gexin Yu:
Spanning tree packing and 2-essential edge-connectivity. Discret. Math. 346(1): 113132 (2023) - [j77]Runrun Liu, Martin Rolek, Gexin Yu:
Optimal connectivity for fat-triangle linkages. Discret. Math. 346(5): 113319 (2023) - [j76]Runrun Liu, Weifan Wang, Gexin Yu:
1-planar graphs are odd 13-colorable. Discret. Math. 346(8): 113423 (2023) - 2022
- [j75]Zhengke Miao, Yimin Song, Gexin Yu:
Note on injective edge-coloring of graphs. Discret. Appl. Math. 310: 65-74 (2022) - [j74]Yue Wang, Gexin Yu:
Partition graphs of independence number 2 into two subgraphs with large chromatic numbers. Discret. Math. 345(4): 112781 (2022) - [j73]Robin M. Givens, Gexin Yu, Rex K. Kincaid:
Open locating-dominating sets in circulant graphs. Discuss. Math. Graph Theory 42(1): 47-62 (2022) - [j72]Yue Wang, Gexin Yu:
Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs. J. Graph Theory 101(1): 134-141 (2022) - 2021
- [j71]Xiangwen Li, Runrun Liu, Gexin Yu:
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Appl. Math. 304: 236-247 (2021) - [j70]Wei Meng, Martin Rolek, Yue Wang, Gexin Yu:
An improved linear connectivity bound for tournaments to be highly linked. Eur. J. Comb. 98: 103390 (2021) - [j69]Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu:
Connectivity for Kite-Linked Graphs. SIAM J. Discret. Math. 35(1): 431-446 (2021) - [j68]Xiaofeng Gu, Wei Meng, Martin Rolek, Yue Wang, Gexin Yu:
Sufficient Conditions for 2-Dimensional Global Rigidity. SIAM J. Discret. Math. 35(4): 2520-2534 (2021) - 2020
- [j67]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: 245-251 (2020) - [j66]Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu:
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. 283: 626-630 (2020) - [j65]Runrun Liu, Gexin Yu:
Planar graphs without short even cycles are near-bipartite. Discret. Appl. Math. 284: 626-630 (2020) - [j64]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): 111661 (2020) - [j63]Lily Chen, Mingfang Huang, Gexin Yu, Xiangqian Zhou:
The strong edge-coloring for graphs with small edge weight. Discret. Math. 343(4): 111779 (2020) - [j62]Seog-Jin Kim, Runrun Liu, Gexin Yu:
Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discret. Math. 343(8): 111714 (2020)
2010 – 2019
- 2019
- [j61]Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu:
DP-3-coloring of some planar graphs. Discret. Math. 342(1): 178-189 (2019) - [j60]Lily Chen, Kecai Deng, Gexin Yu, Xiangqian Zhou:
Strong edge-coloring for planar graphs with large girth. Discret. Math. 342(2): 339-343 (2019) - [j59]Yuxue Yin, Gexin Yu:
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable. Discret. Math. 342(8): 2333-2341 (2019) - [j58]Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou:
DP-4-colorability of two classes of planar graphs. Discret. Math. 342(11): 2984-2993 (2019) - [j57]Runrun Liu, Martin Rolek, Gexin Yu:
Minimum degree condition for a graph to be knitted. Discret. Math. 342(11): 3225-3228 (2019) - [j56]Ilkyoo Choi, Gexin Yu, Xia Zhang:
Planar graphs with girth at least 5 are (3, 4)-colorable. Discret. Math. 342(12) (2019) - [j55]Kecai Deng, Gexin Yu, Xiangqian Zhou:
Recent progress on strong edge-coloring of graphs. Discret. Math. Algorithms Appl. 11(5): 1950062:1-1950062:21 (2019) - [j54]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): 695-705 (2019) - 2018
- [j53]Mingfang Huang, Michael Santana, Gexin Yu:
Strong Chromatic Index of Graphs With Maximum Degree Four. Electron. J. Comb. 25(3): 3 (2018) - [j52]Jian-Bo Lv, Xiangwen Li, Gexin Yu:
On strong edge-coloring of graphs with maximum degree 4. Discret. Appl. Math. 235: 142-153 (2018) - [j51]Tianjiao Dai, Guanghui Wang, Donglei Yang, Gexin Yu:
Strong list-chromatic index of subcubic graphs. Discret. Math. 341(12): 3434-3440 (2018) - [j50]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): 346-364 (2018) - [j49]Ziwen Huang, Xiangwen Li, Gexin Yu:
A relaxation of the strong Bordeaux Conjecture. J. Graph Theory 88(2): 237-254 (2018) - [j48]Gexin Yu:
Covering 2-connected 3-regular graphs with disjoint paths. J. Graph Theory 88(3): 385-401 (2018) - [c3]Robin M. Givens, Rex K. Kincaid, Weizhen Mao, Gexin Yu:
An integer linear program for mixed-weight open locating-dominating sets. CISS 2018: 1-6 - 2017
- [j47]Baogang Xu, Gexin Yu, Xiaoya Zha:
A Note on Chromatic Number and Induced Odd Cycles. Electron. J. Comb. 24(4): 4 (2017) - [j46]Mingfang Huang, Gexin Yu, Xiangqian Zhou:
The strong chromatic index of (3, Δ)-bipartite graphs. Discret. Math. 340(5): 1143-1149 (2017) - [j45]Michael Kopreski, Gexin Yu:
Maximum average degree and relaxed coloring. Discret. Math. 340(10): 2528-2530 (2017) - [j44]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): 1354-1364 (2017) - [c2]Robin M. Givens, Rex K. Kincaid, Weizhen Mao, Gexin Yu:
Mixed-weight open locating-dominating sets. CISS 2017: 1-6 - 2016
- [j43]Jinhua He, Louis A. Valentin, Xiaoyan Yin, Gexin Yu:
Extremal Permutations in Routing Cycles. Electron. J. Comb. 23(3): 3 (2016) - [j42]Runrun Liu, Xiangwen Li, Gexin Yu:
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Math. 339(2): 992-1003 (2016) - [j41]Anke van Zuylen, James C. 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): 718-722 (2016) - 2015
- [j40]Rex K. Kincaid, Allison Oldham, Gexin Yu:
Optimal open-locating-dominating sets in infinite triangular grids. Discret. Appl. Math. 193: 139-144 (2015) - [j39]Runrun Liu, Xiangwen Li, Gexin Yu:
A relaxation of the Bordeaux Conjecture. Eur. J. Comb. 49: 240-249 (2015) - [j38]Gexin Yu:
Strong edge-colorings for k-degenerate graphs. Graphs Comb. 31(5): 1815-1818 (2015) - 2014
- [j37]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): 889-902 (2014) - [i4]Anke van Zuylen, James C. Bieron, Frans Schalekamp, Gexin Yu:
An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. CoRR abs/1402.4867 (2014) - 2013
- [j36]Ari Cukierman, Gexin Yu:
New bounds on the minimum density of an identifying code for the infinite hexagonal grid. Discret. Appl. Math. 161(18): 2910-2924 (2013) - [j35]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): 2312-2317 (2013) - [j34]Chun-Hung Liu, Gexin Yu:
Linear colorings of subcubic graphs. Eur. J. Comb. 34(6): 1040-1050 (2013) - [j33]Ken-ichi Kawarabayashi, Gexin Yu:
Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory B 103(3): 320-326 (2013) - [j32]Owen Hill, Gexin Yu:
A Relaxation of Steinberg's Conjecture. SIAM J. Discret. Math. 27(1): 584-596 (2013) - 2012
- [j31]Lee Williams, Jennifer Vandenbussche, Gexin Yu:
Equitable defective coloring of sparse planar graphs. Discret. Math. 312(5): 957-962 (2012) - [j30]Rong Luo, Rui Xu, Gexin Yu:
An extremal problem on group connectivity of graphs. Eur. J. Comb. 33(6): 1078-1085 (2012) - [j29]Alexandr V. Kostochka, Gexin Yu:
Graphs Containing Every 2-Factor. Graphs Comb. 28(5): 687-716 (2012) - [j28]Mark N. Ellingham, Michael D. Plummer, Gexin Yu:
Linkage for the diamond and the path with four vertices. J. Graph Theory 70(3): 241-261 (2012) - [i3]Chun-Hung Liu, Gexin Yu:
Linear colorings of subcubic graphs. CoRR abs/1206.5348 (2012) - 2011
- [j27]Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective Colorings of Graphs with Low Average Degree. Algorithmica 60(3): 553-568 (2011) - [j26]Daniel W. Cranston, Gexin Yu:
Linear choosability of sparse graphs. Discret. Math. 311(17): 1910-1917 (2011) - [j25]Chase Albert, Chi-Kwong Li, Gilbert Strang, Gexin Yu:
Permutations as Product of Parallel Transpositions. SIAM J. Discret. Math. 25(3): 1412-1417 (2011) - [c1]Yifan Zhang, Qun Li, Gexin Yu, Baosheng Wang:
ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks. INFOCOM 2011: 2471-2479 - 2010
- [j24]Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective colorings of sparse graphs. Discret. Math. 310(21): 2965-2973 (2010) - [j23]Rong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu:
Equitable Coloring of Sparse Planar Graphs. SIAM J. Discret. Math. 24(4): 1572-1583 (2010) - [i2]Daniel W. Cranston, Seog-Jin Kim, Gexin Yu:
Injective colorings of graphs with low average degree. CoRR abs/1006.3776 (2010) - [i1]Daniel W. Cranston, Gexin Yu:
A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. CoRR abs/1006.3779 (2010)
2000 – 2009
- 2009
- [j22]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) - [j21]Hong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan:
Hamiltonian connectedness in 3-connected line graphs. Discret. Appl. Math. 157(5): 982-990 (2009) - [j20]Alexandr V. Kostochka, Gexin Yu:
Ore-type conditions implying 2-factors consisting of short cycles. Discret. Math. 309(14): 4762-4771 (2009) - [j19]Oleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu:
M-degrees of quadrangle-free planar graphs. J. Graph Theory 60(1): 80-85 (2009) - [j18]Qi Liu, Douglas B. West, Gexin Yu:
Implications among linkage properties in graphs. J. Graph Theory 60(4): 327-337 (2009) - [j17]Jennifer Vandenbussche, Douglas B. West, Gexin Yu:
On the Pagenumber of k-Trees. SIAM J. Discret. Math. 23(3): 1455-1464 (2009) - 2008
- [j16]Hemanshu Kaul, Alexandr V. Kostochka, Gexin Yu:
On a graph packing conjecture by Bollobás, Eldridge and Catlin. Comb. 28(4): 469-485 (2008) - [j15]Alexandr V. Kostochka, Gexin Yu:
Minimum degree conditions for H-linked graphs. Discret. Appl. Math. 156(9): 1542-1548 (2008) - [j14]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): 1235-1241 (2008) - [j13]Rong Luo, Rui Xu, Jianhua Yin, Gexin Yu:
Ore-condition and Z3-connectivity. Eur. J. Comb. 29(7): 1587-1595 (2008) - [j12]Alexandr V. Kostochka, Gexin Yu:
Packing of graphs with small product of sizes. J. Comb. Theory B 98(6): 1411-1415 (2008) - [j11]Alexandr V. Kostochka, Gexin Yu:
Ore-type degree conditions for a graph to be H-linked. J. Graph Theory 58(1): 14-26 (2008) - [j10]József Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu:
On the First-Fit Chromatic Number of Graphs. SIAM J. Discret. Math. 22(3): 887-900 (2008) - 2007
- [j9]Alexandr V. Kostochka, Gexin Yu:
Ore-type graph packing problems. Comb. Probab. Comput. 16(1): 167-169 (2007) - [j8]Hong-Jian Lai, Xiangwen Li, Gexin Yu:
An inequality for the group chromatic number of a graph. Discret. Math. 307(23): 3076-3080 (2007) - [j7]Alexandr V. Kostochka, Gexin Yu:
An Ore-type analogue of the Sauer-Spencer Theorem. Graphs Comb. 23(4): 419-424 (2007) - 2006
- [j6]Ken-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu:
On Sufficient Degree Conditions for a Graph to be k-linked. Comb. Probab. Comput. 15(5): 685-694 (2006) - [j5]Matt DeVos, Rui Xu, Gexin Yu:
Nowhere-zero Z3-flows through Z3-connectivity. Discret. Math. 306(1): 26-30 (2006) - [j4]Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu:
On Minimum Degree Implying That a Graph is H-Linked. SIAM J. Discret. Math. 20(4): 829-840 (2006) - 2005
- [j3]Alexandr V. Kostochka, Gexin Yu:
Minimum degree conditions for H-linked graphs. Electron. Notes Discret. Math. 21: 331 (2005) - [j2]Alexandr V. Kostochka, Gexin Yu:
An extremal problem for H-linked graphs. J. Graph Theory 50(4): 321-339 (2005) - 2001
- [j1]Lihua You, Gexin Yu, Bolian Liu:
On maximal (k, b)-linear-free sets of integers and its spectrum. Australas. J Comb. 23: 211-216 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-12 21:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
