Gexin Yu

1.3k total citations
79 papers, 761 citations indexed

About

Gexin Yu is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Networks and Communications. According to data from OpenAlex, Gexin Yu has authored 79 papers receiving a total of 761 indexed citations (citations by other indexed papers that have themselves been cited), including 66 papers in Computational Theory and Mathematics, 35 papers in Discrete Mathematics and Combinatorics and 21 papers in Computer Networks and Communications. Recurrent topics in Gexin Yu's work include Advanced Graph Theory Research (64 papers), Limits and Structures in Graph Theory (35 papers) and Graph Labeling and Dimension Problems (25 papers). Gexin Yu is often cited by papers focused on Advanced Graph Theory Research (64 papers), Limits and Structures in Graph Theory (35 papers) and Graph Labeling and Dimension Problems (25 papers). Gexin Yu collaborates with scholars based in United States, China and Russia. Gexin Yu's co-authors include Alexandr Kostochka, Qun Li, Daniel W. Cranston, Yifan Zhang, Baosheng Wang, Seog‐Jin Kim, Rui Xu, Xiangwen Li, Rong Luo and Ken‐ichi Kawarabayashi and has published in prestigious journals such as IEEE/ACM Transactions on Networking, Linear Algebra and its Applications and Discrete Applied Mathematics.

In The Last Decade

Gexin Yu

73 papers receiving 740 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Gexin Yu United States	15	593	258	241	227	99	79	761
Éric Sopena France	15	823 1.4×	62 0.2×	467 1.9×	165 0.7×	77 0.8×	58	882
Dan Archdeacon United States	15	443 0.7×	70 0.3×	209 0.9×	194 0.9×	138 1.4×	55	603
Frédéric Havet France	16	675 1.1×	98 0.4×	282 1.2×	209 0.9×	62 0.6×	96	746
Chı́nh T. Hoàng Canada	18	895 1.5×	148 0.6×	389 1.6×	144 0.6×	42 0.4×	78	957
Genghua Fan China	17	667 1.1×	159 0.6×	450 1.9×	193 0.9×	30 0.3×	63	781
Ignacio M. Pelayo Spain	13	830 1.4×	114 0.4×	96 0.4×	226 1.0×	41 0.4×	47	917
Stanislav Jendrol′ Slovakia	19	1.3k 2.2×	72 0.3×	380 1.6×	680 3.0×	292 2.9×	137	1.5k
Leizhen Cai Hong Kong	12	474 0.8×	170 0.7×	98 0.4×	47 0.2×	41 0.4×	30	535
Sulamita Klein Brazil	9	424 0.7×	114 0.4×	153 0.6×	122 0.5×	12 0.1×	51	451
Geoffrey Exoo United States	12	424 0.7×	171 0.7×	267 1.1×	191 0.8×	35 0.4×	61	609

Countries citing papers authored by Gexin Yu

Since Specialization

Citations

This map shows the geographic impact of Gexin Yu's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Gexin Yu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gexin Yu more than expected).

Fields of papers citing papers by Gexin Yu

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gexin Yu. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Gexin Yu. The network helps show where Gexin Yu may publish in the future.

Co-authorship network of co-authors of Gexin Yu

This figure shows the co-authorship network connecting the top 25 collaborators of Gexin Yu. A scholar is included among the top collaborators of Gexin Yu based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Gexin Yu. Gexin Yu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Cranston, Daniel W. & Gexin Yu. (2024). Cliques in squares of graphs with maximum average degree less than 4. Journal of Graph Theory. 107(3). 559–577.

Yu, Gexin, et al.. (2020). Packing (1,1,2,2)-coloring of some subcubic graphs. Discrete Applied Mathematics. 283. 626–630. 10 indexed citations

Kim, Seog‐Jin, et al.. (2019). Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discrete Mathematics. 343(8). 111714–111714. 1 indexed citations

Yu, Gexin, et al.. (2019). Planar graphs with girth at least 5 are (3,4)-colorable. Discrete Mathematics. 342(12). 111577–111577. 11 indexed citations

Yu, Gexin, et al.. (2019). Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable. Discrete Mathematics. 342(8). 2333–2341. 8 indexed citations

Li, Xiangwen, et al.. (2017). On strong edge-coloring of graphs with maximum degree 4. Discrete Applied Mathematics. 235. 142–153. 8 indexed citations

Yu, Gexin, et al.. (2016). The strong chromatic index of (3,Δ)-bipartite graphs. Discrete Mathematics. 340(5). 1143–1149. 9 indexed citations

Li, Xiangwen, et al.. (2015). Planar graphs without 5-cycles and intersecting triangles are (1,1,0)-colorable. Discrete Mathematics. 339(2). 992–1003. 10 indexed citations

Wang, Yingqian, et al.. (2013). Planar graphs without cycles of length 4 or 5 are(3,0,0)-colorable. Discrete Mathematics. 313(20). 2312–2317. 21 indexed citations

10.

Yu, Gexin, et al.. (2013). New bounds on the minimum density of an identifying code for the infinite hexagonal grid. Discrete Applied Mathematics. 161(18). 2910–2924. 9 indexed citations

11.

Kawarabayashi, Ken‐ichi & Gexin Yu. (2013). Connectivities for k -knitted graphs and for minimal counterexamples to Hadwigerʼs Conjecture. Journal of Combinatorial Theory Series B. 103(3). 320–326. 2 indexed citations

12.

Luo, Rong, et al.. (2012). An extremal problem on group connectivity of graphs. European Journal of Combinatorics. 33(6). 1078–1085. 11 indexed citations

13.

Yu, Gexin, et al.. (2011). Equitable defective coloring of sparse planar graphs. Discrete Mathematics. 312(5). 957–962. 3 indexed citations

14.

Cranston, Daniel W., Seog‐Jin Kim, & Gexin Yu. (2010). Injective colorings of sparse graphs. Discrete Mathematics. 310(21). 2965–2973. 25 indexed citations

15.

Kostochka, Alexandr & Gexin Yu. (2008). Ore-type conditions implying 2-factors consisting of short cycles. Discrete Mathematics. 309(14). 4762–4771. 2 indexed citations

16.

Kostochka, Alexandr & Gexin Yu. (2008). Packing of graphs with small product of sizes. Journal of Combinatorial Theory Series B. 98(6). 1411–1415. 1 indexed citations

17.

Lai, Hong‐Jian, Xiangwen Li, & Gexin Yu. (2007). An inequality for the group chromatic number of a graph. Discrete Mathematics. 307(23). 3076–3080. 4 indexed citations

18.

Liu, Bo, Lihua You, & Gexin Yu. (2006). On extremal matrices of second largest exponent by Boolean rank. Linear Algebra and its Applications. 422(1). 186–197. 2 indexed citations

19.

Kostochka, Alexandr & Gexin Yu. (2005). An extremal problem for H -linked graphs. Journal of Graph Theory. 50(4). 321–339. 12 indexed citations

20.

DeVos, Matt, Rui Xu, & Gexin Yu. (2005). Nowhere-zero Z3-flows through Z3-connectivity. Discrete Mathematics. 306(1). 26–30. 26 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact