Gexin Yu Coauthor index pubzone.org

Facets and more with CompleteSearch

Listing of the DBLP Bibliography Server - FAQ
Other views (modern): by type - by year
Other mirrors: Trier I - Trier II


Ask others: ACM DL/Guide - CiteSeerx - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2017
j44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMingfang Huang, Gexin Yu, Xiangqian Zhou: The strong chromatic index of (3, Δ)-bipartite graphs. Discrete Mathematics 340(5): 1143-1149 (2017)
j43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYing 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)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRobin M. Givens, Rex K. Kincaid, Weizhen Mao, Gexin Yu: Mixed-weight open locating-dominating sets. CISS 2017: 1-6
2016
j42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJinhua He, Louis A. Valentin, Xiaoyan Yin, Gexin Yu: Extremal Permutations in Routing Cycles. Electr. J. Comb. 23(3): P3.47 (2016)
j41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRunrun Liu, Xiangwen Li, Gexin Yu: Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. Discrete Mathematics 339(2): 992-1003 (2016)
j40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnke van Zuylen, James 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
j39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRex K. Kincaid, Allison Oldham, Gexin Yu: Optimal open-locating-dominating sets in infinite triangular grids. Discrete Applied Mathematics 193: 139-144 (2015)
j38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRunrun Liu, Xiangwen Li, Gexin Yu: A relaxation of the Bordeaux Conjecture. Eur. J. Comb. 49: 240-249 (2015)
j37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGexin Yu: Strong edge-colorings for k-degenerate graphs. Graphs and Combinatorics 31(5): 1815-1818 (2015)
2014
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnke van Zuylen, James Bieron, Frans Schalekamp, Gexin Yu: An Upper Bound on the Number of Circular Transpositions to Sort a Permutation. CoRR abs/1402.4867 (2014)
j36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYifan 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)
2013
j35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAri Cukierman, Gexin Yu: New bounds on the minimum density of an identifying code for the infinite hexagonal grid. Discrete Applied Mathematics 161(18): 2910-2924 (2013)
j34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOwen 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. Discrete Mathematics 313(20): 2312-2317 (2013)
j33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Hung Liu, Gexin Yu: Linear colorings of subcubic graphs. Eur. J. Comb. 34(6): 1040-1050 (2013)
j32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Gexin Yu: Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's Conjecture. J. Comb. Theory, Ser. B 103(3): 320-326 (2013)
j31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOwen Hill, Gexin Yu: A Relaxation of Steinberg's Conjecture. SIAM J. Discrete Math. 27(1): 584-596 (2013)
2012
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChun-Hung Liu, Gexin Yu: Linear colorings of subcubic graphs .CoRR abs/1206.5348 (2012)
j30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLee Williams, Jennifer Vandenbussche, Gexin Yu: Equitable defective coloring of sparse planar graphs. Discrete Mathematics 312(5): 957-962 (2012)
j29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRong Luo, Rui Xu, Gexin Yu: An extremal problem on group connectivity of graphs. Eur. J. Comb. 33(6): 1078-1085 (2012)
j28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: Graphs Containing Every 2-Factor. Graphs and Combinatorics 28(5): 687-716 (2012)
j27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark N. Ellingham, Michael D. Plummer, Gexin Yu: Linkage for the diamond and the path with four vertices. Journal of Graph Theory 70(3): 241-261 (2012)
2011
j26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective Colorings of Graphs with Low Average Degree. Algorithmica 60(3): 553-568 (2011)
j25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel W. Cranston, Gexin Yu: Linear choosability of sparse graphs. Discrete Mathematics 311(17): 1910-1917 (2011)
j24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChase Albert, Chi-Kwong Li, Gilbert Strang, Gexin Yu: Permutations as Product of Parallel Transpositions. SIAM J. Discrete Math. 25(3): 1412-1417 (2011)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYifan Zhang, Qun Li, Gexin Yu, Baosheng Wang: ETCH: Efficient Channel Hopping for communication rendezvous in dynamic spectrum access networks. INFOCOM 2011: 2471-2479
2010
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective colorings of graphs with low average degree .CoRR abs/1006.3776 (2010)
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel 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)
j23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel W. Cranston, Seog-Jin Kim, Gexin Yu: Injective colorings of sparse graphs. Discrete Mathematics 310(21): 2965-2973 (2010)
j22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRong Luo, Jean-Sébastien Sereni, D. Christopher Stephens, Gexin Yu: Equitable Coloring of Sparse Planar Graphs. SIAM J. Discrete Math. 24(4): 1572-1583 (2010)
2009
j21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDaniel W. Cranston, Gexin Yu: A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid. Electr. J. Comb. 16(1) (2009)
j20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHong-Jian Lai, Yehong Shao, Gexin Yu, Mingquan Zhan: Hamiltonian connectedness in 3-connected line graphs. Discrete Applied Mathematics 157(5): 982-990 (2009)
j19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: Ore-type conditions implying 2-factors consisting of short cycles. Discrete Mathematics 309(14): 4762-4771 (2009)
j18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOleg V. Borodin, Alexandr V. Kostochka, Naeem N. Sheikh, Gexin Yu: M-degrees of quadrangle-free planar graphs. Journal of Graph Theory 60(1): 80-85 (2009)
j17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQi Liu, Douglas B. West, Gexin Yu: Implications among linkage properties in graphs. Journal of Graph Theory 60(4): 327-337 (2009)
j16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJennifer Vandenbussche, Douglas B. West, Gexin Yu: On the Pagenumber of k-Trees. SIAM J. Discrete Math. 23(3): 1455-1464 (2009)
2008
j15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHemanshu Kaul, Alexandr V. Kostochka, Gexin Yu: On a graph packing conjecture by Bollobás, Eldridge and Catlin. Combinatorica 28(4): 469-485 (2008)
j14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: Minimum degree conditions for H-linked graphs. Discrete Applied Mathematics 156(9): 1542-1548 (2008)
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOleg 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)
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRong Luo, Rui Xu, Jianhua Yin, Gexin Yu: Ore-condition and Z3-connectivity. Eur. J. Comb. 29(7): 1587-1595 (2008)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: Packing of graphs with small product of sizes. J. Comb. Theory, Ser. B 98(6): 1411-1415 (2008)
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: Ore-type degree conditions for a graph to be H-linked. Journal of Graph Theory 58(1): 14-26 (2008)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJózsef Balogh, Stephen G. Hartke, Qi Liu, Gexin Yu: On the First-Fit Chromatic Number of Graphs. SIAM J. Discrete Math. 22(3): 887-900 (2008)
2007
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: Ore-type graph packing problems. Combinatorics, Probability & Computing 16(1): 167-169 (2007)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHong-Jian Lai, Xiangwen Li, Gexin Yu: An inequality for the group chromatic number of a graph. Discrete Mathematics 307(23): 3076-3080 (2007)
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: An Ore-type analogue of the Sauer-Spencer Theorem. Graphs and Combinatorics 23(4): 419-424 (2007)
2006
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKen-ichi Kawarabayashi, Alexandr V. Kostochka, Gexin Yu: On Sufficient Degree Conditions for a Graph to be k-linked. Combinatorics, Probability & Computing 15(5): 685-694 (2006)
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatt DeVos, Rui Xu, Gexin Yu: Nowhere-zero Z3-flows through Z3-connectivity. Discrete Mathematics 306(1): 26-30 (2006)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRonald J. Gould, Alexandr V. Kostochka, Gexin Yu: On Minimum Degree Implying That a Graph is H-Linked. SIAM J. Discrete Math. 20(4): 829-840 (2006)
2005
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: Minimum degree conditions for H-linked graphs. Electronic Notes in Discrete Mathematics 21: 331 (2005)
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr V. Kostochka, Gexin Yu: An extremal problem for H-linked graphs. Journal of Graph Theory 50(4): 321-339 (2005)

Coauthor Index

1Chase Albert[j24]
2Ying Bai[j43]
3József Balogh[j9]
4James Bieron[j40] [i4]
5Oleg V. Borodin[j18] [j13]
6Daniel W. Cranston[j26] [j25] [i2] [i1] [j23] [j21]
7Ari Cukierman[j35]
8Matt DeVos[j4]
9Mark N. Ellingham[j27]
10Robin M. Givens[c2]
11Ronald J. Gould[j3]
12Stephen G. Hartke[j9]
13Jinhua He[j42]
14Owen Hill[j34] [j31]
15Mingfang Huang[j44]
16Hemanshu Kaul[j15]
17Ken-ichi Kawarabayashi[j32] [j5]
18Seog-Jin Kim[j26] [i2] [j23]
19Rex K. Kincaid[c2] [j39]
20Alexandr V. Kostochka[j28] [j19] [j18] [j15] [j14] [j13] [j11] [j10] [j8] [j6] [j5] [j3] [j2] [j1]
21Hong-Jian Lai[j20] [j7]
22Chi-Kwong Li[j24]
23Qun Li[j36] [c1]
24Xiangwen Li[j43] [j41] [j38] [j7]
25Chun-Hung Liu[j33] [i3]
26Qi Liu[j17] [j9]
27Runrun Liu[j41] [j38]
28Rong Luo[j29] [j22] [j12]
29Weizhen Mao[c2]
30Allison Oldham[j39]
31Michael D. Plummer[j27]
32Frans Schalekamp[j40] [i4]
33Jean-Sébastien Sereni[j22]
34Yehong Shao[j20]
35Naeem N. Sheikh[j18] [j13]
36Diana Smith[j34]
37D. Christopher Stephens[j22]
38Gilbert Strang[j24]
39Louis A. Valentin[j42]
40Jennifer Vandenbussche[j30] [j16]
41Baosheng Wang[j36] [c1]
42Haodong Wang[j36]
43Yingqian Wang[j34]
44Douglas B. West[j17] [j16]
45Lee Williams[j30]
46Lingji Xu[j34]
47Rui Xu[j29] [j12] [j4]
48Jianhua Yin[j12]
49Xiaoyan Yin[j42]
50Mingquan Zhan[j20]
51Yifan Zhang 0002[j36] [c1]
52Xiangqian Zhou[j44]
53Xiaojun Zhu 0001[j36]
54Anke van Zuylen[j40] [i4]

 

Last update 2017-06-11 01:15 CEST by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page