杨超

广东外语外贸大学
数学与统计学院 副教授 硕士生导师
应用数学系主任

Chao YANG

Associate Professor
Chair of Department of Applied Mathematics
School of Mathematics and Statistics
Guangdong University of Foreign Studies (GDUFS)
Guangzhou, 510006, China
E-mail: yangchao AT gdufs DOT edu DOT cn
sokoban2007 AT 163 DOT com

My webpage at GDUFS.

Work Experience

Education

Guangzhou Discrete Math Seminar

I co-organize the Guangzhou Discrete Math Seminar, which started in September 2017. If anyone is interested in giving a seminar talk, or for general enquiries, please contact me or other organizers.

Research Interests

Graph Theory, Theoretical Computer Science, Combinatorial Games and Puzzles, Plane Tilings, and various topics in Discrete Mathematics

Publications and Preprints

My papers indexed by MathSciNet of AMS.

See also my record at ORCID, and my author page at Semantic Scholar.

  1. (With Zhujun Zhang) Undecidability of tiling the plane with a fixed number of Wang bars. arXiv:2404.04504
  2. (With Zhujun Zhang) A proof of Ollinger's conjecture: undecidability of tiling the plane with a set of 8 polyominoes. arXiv:2403.13472
  3. (With Zhujun Zhang) Atropos-k is PSPACE-complete. arXiv:2403.01662
  4. (With Zhujun Zhang) Friends-and-strangers is PSPACE-complete. arXiv:2402.03685
  5. On the Undecidability of Tiling the plane with a Set of 9 Polyominoes (in Chinese). to appear in SCIENTIA SINICA Mathematica. https://doi.org/10.1360/SSM-2024-0035
  6. Wang Tiles: Connectivity when Tiling a Plane. Thai Journal of Mathematics. 21(4)(2023), 991–1009. https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1561
  7. On the Complexity of Motion Planning Problem of a Forklift. Thai Journal of Mathematics. 21(4)(2023), 785-798. https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1545
  8. Practice of Ideological and Political Teaching in “Mathematical Statistics” Course. Advances in Education. 13(11) (2023), 8679-8683.
  9. Tiling the Plane with a Set of Ten Polyominoes. International Journal of Computational Geometry & Applications. 33(03n04)(2023), 55-64. https://doi.org/10.1142/S0218195923500012
  10. The Spectral Distribution of Random Mixed Graphs. Axioms. 11(3) (2022), 126. https://doi.org/10.3390/axioms11030126 (With Yue Guan, Bo Cheng, Minfeng Chen, Meili Liang, Jianxi Liu, Jinxun Wang and Li Zeng)
  11. The linear k-arboricity of digraphs. AIMS Mathematics. 7(3) (2022), 4137-4152. https://doi.org/10.3934/math.2022229 (With Xiaoling Zhou and Weihua He)
  12. The linear k-arboricity of symmetric directed trees. AIMS Mathematics. 7(2) (2022), 1603-1614. https://doi.org/10.3934/math.2022093 (With Xiaoling Zhou and Weihua He)
  13. Ricci-flat graphs with girth four. Acta Mathematica Sinica, English Series. 37(11) (2021), 1679-1691. https://doi.org/10.1007/s10114-021-9546-y (With Weihua He, Jun Luo, Wei Yuan and Hui Chun Zhang)
  14. On the Complexity of Jelly-no-Puzzle. In: Akiyama J., Marcelo R.M., Ruiz MJ.P., Uno Y. (eds) Discrete and Computational Geometry, Graphs, and Games. JCDCGGG 2018. Lecture Notes in Computer Science, vol 13034 (2021), Springer, Cham. 165-174. https://doi.org/10.1007/978-3-030-90048-9_13
  15. Teaching Advanced Mathematics with the New Technological Achievements of China—Using the Tianwen-1 Spacecraft as an Example. Advances in Education. 11(1) (2021), 68-72.
  16. On the Upper Bound of Modular Chromatic Number of Graphs. Advances in Applied Mathematics. 9(8) (2020), 1309-1312.
  17. Unified extremal results of topological indices and spectral invariants of graphs. Discrete Applied Mathematics. 271 (2019), 218-232. (With Yuedan Yao, Muhuo Liu, Francesco Belardo)
  18. Hanano Puzzle is NP-hard. Information Processing Letters. 145 (2019), 6-10. (With Ziwen Liu)
  19. The Non-Deterministic Constraint Logic and Its Applications in Computational Complexity. Computer Science and Application. 7(5) (2017), 407-413. (With Ziwen Liu)
  20. SNOWMAN is PSPACE-complete. Theoretical Computer Science. 677 (2017) 31-40. (With Weihua He and Ziwen Liu)
  21. Connectivity of lexicographic product and direct product of graphs, Ars Combinatoria. 111 (2013), 3-12. (With Jun-Ming Xu)
  22. Sliding puzzles and rotating puzzles on graphs , Discrete Mathematics. 311 (2011), 1290–1294 .
  23. Connectivity and super-connectivity of Cartesian product graphs, Ars Combinatoria. 95 (2010), 235-245. (With Jun-Ming Xu)
  24. Diameter vulnerability of graphs by edge deletion. Discrete Mathematics. 309 (2009), 1001-1006. (With He-Xi Ye and Jun-Ming Xu)
  25. Forwarding index of cube-connected cycles. Discrete Applied Mathematics. 157(1) (2009), 1-7. (With Jun Yan and Jun-Ming Xu)
  26. Reliability of interconnection networks modeled by Cartesian product digraphs. Networks, 52(4) (2008), 202-205. (With Jun-Ming Xu)
  27. Connectivity and Edge-connectivity of Strong Product Graphs, Journal of University of Science and Technology of China, 38(5) (2008), 449- 455. (With Jun-Ming Xu)
  28. Cover pebbling number of some product graphs, Journal of University of Science and Technology of China, 38(9) (2008), 1030- 1035. (With Wei Kong, Yong-Liang Pan)
  29. Fault Diameter of Product Graphs, Information Processing Letters. 102 (2007), 226-228. (With Jun-Ming Xu)
  30. Feedback Number of Kautz Digraph, Discrete Mathematics, 307 (2007), 1589-1599. (With Jun-Ming Xu, Ye-Zhou Wu, Jia Huang)
  31. Some graphs with minimum Hosoya index and Maximum Merrifield-Simmons index, MATCH Communications in Mathematical and in Computer Chemistry. 57(1) (2007), 235-242. (With Xiang-Feng Pan, Jun-Ming Xu and Min-Jie Zhou)
  32. On the Randic index of unicyclic graphs with k pendant vertices, MATCH Communications in Mathematical and in Computer Chemistry. 55(2) (2006), 409417. (With Xiang-Feng Pan, Jun-Ming Xu)
  33. Connectivity of Cartesian product graphs, Discrete Mathematics, 306(1) (2006), 159-165. (With Jun-Ming Xu)

Academic Service

微信扫一扫，关注DiscreteMath2018微信公众号

Non-academic Activities

Last modified: January 30, 2024