pith. sign in

Gexin Yu

Identifiers

  • name variant Gexin Yu 0.60 · backfill

Papers (28)

  1. Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles math.CO · 2026 · author #3
  2. Fat-triangle linkage and kite-linked graphs math.CO · 2019 · author #3
  3. Minimum degree condition for a graph to be knitted math.CO · 2018 · author #3
  4. DP-4-colorability of two classes of planar graphs math.CO · 2018 · author #3
  5. DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$ math.CO · 2018 · author #5
  6. Strong list-chromatic index of subcubic graphs math.CO · 2018 · author #4
  7. Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable math.CO · 2018 · author #2
  8. Planar graphs without 4-cycles and close triangles are (2,0,0)-colorable math.CO · 2018 · author #4
  9. Maximum average degree and relaxed coloring math.CO · 2018 · author #2
  10. The strong chromatic index of $(3,\Delta)$-bipartite graphs math.CO · 2018 · author #2
  11. Covering 2-connected 3-regular graphs with disjoint paths math.CO · 2018 · author #1
  12. Strong chromatic index of graphs with maximum degree four math.CO · 2018 · author #3
  13. DP-3-coloring of some planar graphs math.CO · 2018 · author #4
  14. Equitable coloring of sparse planar graphs math.CO · 2016 · author #4
  15. A relaxation of the strong Bordeaux Conjecture math.CO · 2015 · author #3
  16. Planar graphs without 5-cycles and intersecting triangles are $(1,1,0)$-colorable math.CO · 2014 · author #3
  17. A relaxation of the Bordeaux Conjecture math.CO · 2014 · author #3
  18. Extremal permutations in routing cycles math.CO · 2014 · author #4
  19. Optimal open-locating-dominating sets in infinite triangular grids math.CO · 2014 · author #3
  20. An Upper Bound on the Number of Circular Transpositions to Sort a Permutation cs.DM · 2014 · author #4
  21. Strong edge-colorings for k-degenerate graphs math.CO · 2012 · author #1
  22. Perfect partition of some regular bipartite graphs math.CO · 2012 · author #3
  23. A relaxation of Steinberg's Conjecture math.CO · 2012 · author #2
  24. New Bounds on the Minimum Density of a Vertex Identifying Code for the Infinite Hexagonal Grid math.CO · 2011 · author #2
  25. Linear Choosability of Sparse Graphs math.CO · 2010 · author #2
  26. Injective colorings of sparse graphs math.CO · 2010 · author #3
  27. A New Lower Bound on the Density of Vertex Identifying Codes for the Infinite Hexagonal Grid math.CO · 2010 · author #2
  28. Injective colorings of graphs with low average degree math.CO · 2010 · author #3

Mentions

  • 1409.4054 #3 · backfill · confidence 0.70 Gexin Yu
  • 1407.5138 #3 · backfill · confidence 0.70 Gexin Yu
  • 1404.1851 #4 · backfill · confidence 0.70 Gexin Yu
  • 1403.7061 #3 · backfill · confidence 0.70 Gexin Yu
  • 1402.4867 #4 · backfill · confidence 0.70 Gexin Yu
  • 1212.6093 #1 · backfill · confidence 0.70 Gexin Yu
  • 1212.6091 #3 · backfill · confidence 0.70 Gexin Yu
  • 2605.23647 #3 · arxiv_oai · confidence 0.70 Gexin Yu
  • 1208.3395 #2 · backfill · confidence 0.70 Gexin Yu
  • 1110.1097 #2 · backfill · confidence 0.70 Gexin Yu
  • 1007.1615 #2 · backfill · confidence 0.70 Gexin Yu
  • 1007.0786 #3 · backfill · confidence 0.70 Gexin Yu
  • 1006.3779 #2 · backfill · confidence 0.70 Gexin Yu
  • 1006.3776 #3 · backfill · confidence 0.70 Gexin Yu

Frequent Coauthors