学如逆水行舟, 不进则退

Submitted Papers:

• Towards the Overfull Conjecture II (with Guantao Chen and Jessica McDonald).
  Available as arXiv:2607.02270.

• Exploring the world of edge-chromatic 3-critical graphs (with Yucheng Zhong).
  Available as arXiv:2606.27131.

• Graceful Labeling of Two Families of Spiders (with Le Chen).
  Available as arXiv:2605.14295.

• Equitable tree colouring of graphs (with Yuping Gao and Allan Lo).
  Available as arXiv:2604.13606.

• Vertex-distinguishing edge coloring of graphs (with Yuping Gao, Guanghui Wang, and Yiming Zhou).
  Available as arXiv:2512.10827.

• Degree sequences realizing labelled perfect matchings (with Joseph Briggs and Jessica McDonald).
  Available as arXiv:2510.01110.

• Total coloring graphs with large minimum degree (with Owen Henderschedt and Jessica McDonald).
  Available as arXiv:2507.05548.

• 2-factors in 3/2-tough maximal planar graphs (with Lili Hao, Hui Ma, and Weihua Yang).
  Available as arXiv:2507.00395.

• Hamilton cycles in tough (2P₂ ∪ P₁)-free graphs (with Arthur Tanyel).
  Available as arXiv:2506.12684.

• Linear arboricity of graphs with large minimum degree (with Yuping Gao).
  Available as arXiv:2405.18494.

• Degree sequence condition for Hamiltonicity in tough graphs (with Arthur Tanyel).
  Available as arXiv:2405.04728.

• Toughness and the existence of k-factors in hypergraphs (with Yuping Gao and Gexin Yu).
  Available as arXiv:2304.14172.

Published Papers:

• Spanning Euler Tours in Hypergraphs (with Amin Bahmanian).
  J. Combin. Theory Ser. A, 222 (2026), 106194.

• Towards the Overfull Conjecture.
  J. Graph Theory, 112 (2026), no. 4, 370–408.

• Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs (with Yuping Gao and Guanghui Wang).
  J. Graph Theory, 113 (2026), no. 1, 73–87.

• Spanning weakly even trees of graphs (with Jiangdong Ai, M. N. Ellingham, Zhipeng Gao, Yixuan Huang, Xiangzhou Liu, Simon Špacapan, and Jun Yue).
  J. Graph Theory, 112 (2026), no. 4, 484–490.

• Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree (with Rachel Galindo and Jessica McDonald).
  Discrete Appl. Math., 383 (2026), 383–386.

• A strengthening of a degree sequence condition for Hamiltonicity in tough graphs (with Arthur Tanyel).
  Discrete Math., 349 (2026), no. 9, 115134.

• Hamiltonian cycles in tough (P₄ ∪ P₁)-free graphs.
  J. Graph Theory (2026), 1–19. doi: 10.1002/jgt.70090.

• A reduction of the “cycles plus K₄’s” problem (with Aseem Dalal and Jessica McDonald).
  Discrete Math., 349 (2026), no. 2, 114696.

• Total coloring graphs with large maximum degree (with Aseem Dalal and Jessica McDonald).
  J. Graph Theory, 110 (2025), no. 3, 249–262.

• Pseudo-multifan and Lollipop (with Yan Cao, Guantao Chen, and Guangming Jing).
  J. Graph Theory, 110 (2025), no. 2, 155–166.

• Edge Cover Through Edge Coloring (with Guantao Chen).
  Electron. J. Combin., 32 (2025), no. 2, P2.28.

• On the Multigraph Overfull Conjecture (with Michael J. Plantholt).
  J. Graph Theory, 109 (2025), no. 2, 226–236.

• A construction of a 3/2-tough plane triangulation with no 2-factor.
  J. Graph Theory, 109 (2025), no. 1, 5–18.

• Precoloring extension of Vizing’s Theorem for multigraphs (with Yan Cao, Guantao Chen, Guangming Jing, and Xuli Qi).
  Eur. J. Comb., 122 (2024), 104037.

• An Ore-type condition for hamiltonicity in tough graphs and the extremal examples (with Masahiro Sanka).
  Electron. J. Combin., 31 (2024), no. 1, P1.60.

• The overfull conjecture on graphs of odd order and large minimum degree.
  J. Graph Theory, 106 (2024), no. 2, 322–351.

• Overfullness of edge-critical graphs with small minimal core degree (with Yan Cao, Guantao Chen, and Guangming Jing).
  J. Graph Theory, 106 (2024), no. 1, 67–80.

• The core conjecture of Hilton and Zhao (with Yan Cao, Guantao Chen, and Guangming Jing).
  J. Combin. Theory Ser. B, 166 (2024), 154–182.

• Triangle-degree and triangle-distinct graphs (with Zhanar Berikkyzy, Beth Bjorkman, Heather C. Smith Blake, Sogol Jahanbekam, Lauren Keough, Kevin Moss, and Danny Rorabaugh).
  Discrete Math., 347 (2024), no. 1, 113695.

• Antimagic Orientation of Forests (with Xiaowei Yu).
  Discrete Math., 347 (2024), no. 1, 113666.

• Characterization of Graphs of Diameter 2 Containing a Homeomorphically Irreducible Spanning Tree (with Shoichi Tsuchiya).
  J. Graph Theory, 104 (2023), no. 4, 886–903.

• Existence of 2-Factors in Tough Graphs without Forbidden Subgraphs (with Elizabeth Grimm and Anna Johnsen).
  Discrete Math., 346 (2023), no. 10, 113578.

• Edge coloring graphs with large minimum degree (with Michael J. Plantholt).
  J. Graph Theory, 102 (2023), no. 4, 611–632.

• Erdős–Gyárfás Conjecture for P₈-free graphs (with Yuping Gao).
  Graphs Combin., 38 (2022), 168.

• The overfullness of graphs with small minimum degree and large maximum degree (with Yan Cao, Guantao Chen, and Guangming Jing).
  SIAM J. Discrete Math., 36 (2022), no. 3, 2258–2270.

• Towards the Small Quasi-Kernel Conjecture (with Alexandr Kostochka and Ruth Luo).
  Electron. J. Combin., 29 (2022), no. 3, P3.49.

• Chromatic index of dense quasirandom graphs.
  J. Combin. Theory Ser. B, 157 (2022), 429–450.

• A note on hamiltonian cycles in 4-tough (P₂ ∪ kP₁)-free graphs (with Lingjuan Shi).
  Discrete Math., 345 (2022), no. 12, 113081.

• Hamiltonian cycles in 7-tough (P₃ ∪ 2P₁)-free graphs (with Yuping Gao).
  Discrete Math., 345 (2022), no. 12, 113069.

• An improvement to the Hilton–Zhao vertex-splitting conjecture (with Yan Cao and Guantao Chen).
  Discrete Math., 345 (2022), no. 8, 112902.

• Overfullness of critical class 2 graphs with a small core degree (with Yan Cao and Guantao Chen).
  J. Combin. Theory Ser. B, 156 (2022), 145–173.

• Independence number of edge-chromatic critical graphs (with Yan Cao, Guantao Chen, and Guangming Jing).
  J. Graph Theory, 101 (2022), no. 2, 288–310.

• Antimagic orientation of subdivided caterpillars (with Jessica Ferraro and Genevieve Newkirk).
  Discrete Appl. Math., 313 (2022), 45–52.

• An Ore-type condition for hamiltonicity in tough graphs.
  Electron. J. Combin., 29 (2022), no. 1, P1.5.

• Nonempty intersection of longest paths in graphs without forbidden pairs (with Yuping Gao).
  Discrete Appl. Math., 304 (2021), 76–83.

• Antimagic orientation of graphs with minimum degree at least 33.
  J. Graph Theory, 98 (2021), no. 4, 676–690.

• Hamiltonian cycles in tough (P₂ ∪ P₃)-free graphs.
  Electron. J. Combin., 28 (2021), no. 1, P1.36.

• Toughness and spanning trees in K₄-minor-free graphs (with Mark Ellingham, Dong Ye, and Xiaoya Zha).
  J. Graph Theory, 96 (2021), no. 3, 379–402.

• Antimagic orientation of lobsters (with Yuping Gao).
  Discrete Appl. Math., 287 (2020), 21–26.

• Toughness and prism-hamiltonicity of P₄-free graphs (with M. N. Ellingham and Pouria Salehi Nowbandegani).
  Discrete Appl. Math., 284 (2020), 201–206.

• Regular Colorings in Regular Graphs (with Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, and Andrew J. Uzzell).
  Discuss. Math. Graph Theory, 40 (2020), no. 3, 795–806.

• Hamiltonian cycles in 3-tough 2K₂-free graphs.
  J. Graph Theory, 94 (2020), no. 3, 349–363.

• Dirac’s Condition for Spanning Halin Subgraphs (with Guantao Chen).
  SIAM J. Discrete Math., 33 (2019), no. 4, 1997–2022.

• Characterizing the Difference Between Graph Classes Defined by Forbidden Pairs Including the Claw (with Guantao Chen, Michitaka Furuya, Shoichi Tsuchiya, and Ping Yang).
  Graphs Combin., 35 (2019), no. 6, 1459–1474.

• Vizing’s 2-factor conjecture involving maximum degree and toughness conditions (with Jinko Kanno).
  Electron. J. Combin., 26 (2019), no. 2, P2.17.

• Chromatic index determined by fractional chromatic index (with Guantao Chen, Yuping Gao, Ringi Kim, and Luke Postle).
  J. Combin. Theory Ser. B, 131 (2018), 85–108.

• Nonempty intersection of longest paths in 2K₂-free graphs (with Gili Golan).
  Electron. J. Combin., 25 (2018), no. 2, P2.37.

• Antimagic orientation of biregular bipartite graphs (with Xiaowei Yu).
  Electron. J. Combin., 24 (2017), no. 4, P4.31.

• Forbidden pairs and the existence of a spanning Halin subgraph (with Guantao Chen, Jie Han, Suil O, and Shoichi Tsuchiya).
  Graphs Combin., 33 (2017), no. 5, 1321–1345.

• Spanning trails with maximum degree at most 4 in 2K₂-free graphs (with Guantao Chen, Mark Ellingham, and Akira Saito).
  Graphs Combin., 33 (2017), no. 5, 1095–1101.

• Vizing’s 2-factor conjecture involving large maximum degree (with Guantao Chen).
  J. Graph Theory, 86 (2017), no. 4, 422–438.

• Nonempty intersection of longest paths in series-parallel graphs (with Guantao Chen, Julia Ehrenmüller, Cristina G. Fernandes, Carl Georg Heise, Ping Yang, and Amy Yates).
  Discrete Math., 340 (2017), no. 3, 287–304.

• Equitable vertex arboricity of 5-degenerate graphs (with Guantao Chen, Yuping Gao, Guanghui Wang, and Jianliang Wu).
  J. Combin. Optim., 34 (2017), no. 2, 426–432.

• Characterizing forbidden pairs for hamiltonian squares (with Guantao Chen).
  Graphs Combin., 31 (2015), no. 6, 2113–2124.

• Disjoint chorded cycles of the same length (with Guantao Chen, Ronald J. Gould, Kazuhide Hirohata, and Katsuhiro Ota).
  SIAM J. Discrete Math., 29 (2015), no. 2, 1030–1041.

• The existence of a 2-factor in a graph satisfying the local Chvátal–Erdős condition (with Guantao Chen and Akira Saito).
  SIAM J. Discrete Math., 27 (2013), no. 4, 1788–1799.

• Homeomorphically irreducible spanning trees (with Guantao Chen).
  J. Combin. Theory Ser. B, 103 (2013), no. 4, 409–414.

• On equitable vertex distinguishing edge colorings of trees (with Bing Yao and Xiangen Chen).
  Acta Math. Sci. Ser. B Engl. Ed., 33 (2013), no. 3, 621–630.

• Homeomorphically irreducible spanning trees in locally connected graphs (with Guantao Chen and Han Ren).
  Combin. Probab. Comput., 21 (2012), nos. 1–2, 107–111.

• Genus of Cₘ,ₙ and strong genus embedding of Kₘ,ₙ (with Han Ren).
  J. East China Norm. Univ. Natur. Sci. Ed., 2011, no. 2, 17–21.

• Inverse eigenvalue problem for nonnegative matrices.
  J. East China Norm. Univ. Natur. Sci. Ed., 2009, no. 4, 35–37.

• The k-balancings of two families of graphs.
  Journal of Gansu Normal Colleges, 12 (2007), no. 5, 13–15.