I got a PhD at the UT back in 1988 in Graph Theory, a subarea of Discrete Mathematics. After that, I stayed at the UT as a lecturer, senior lecturer and professor in Discrete Mathematics until 2004. That year I moved to Durham University in the Northeast of England to take up a position as a Chair (full professor) in Theoretical Computer Science. There I have helped to build up the strong ACiD group in Algorithms and Complexity. In 2011, I returned to the UT as a professor in Programmable Nanosystems. My current research is a mixture of Structural Graph Theory, Algorithmic Graph Theory, Applications of Graph Theory, Computational Complexity, and Unconventional Computing, in particular Neuromorphic Computing and Brain Inspired Computing.
# Claw-Free Graphs # Connected Graph # Degree Condition # Edge-Colored Graph # Graph In Graph Theory # Hamiltonicity # Ramsey Number # Toughness
My current research is a mixture of Structural Graph Theory, Algorithmic Graph Theory, Applications of Graph Theory, Computational Complexity, and Unconventional Computing, in particular Neuromorphic Computing and Brain Inspired Computing.
Yang, X. (2023). Spectral properties of digraphs with a fixed dichromatic number. [PhD Thesis - Research UT, graduation UT, University of Twente]. University of Twente. https://doi.org/10.3990/1.9789036558549
Wu, F. (2023). Properly colored and rainbow cycles in edge-colored graphs. [PhD Thesis - Research UT, graduation UT, University of Twente]. University of Twente. https://doi.org/10.3990/1.9789036558525
Dong, Y. , Broersma, H., Song, C., Wan, P., & Zhang, S. (2023). The effect of graph operations on the degree-based entropy. Applied mathematics and computation, 437, Article 127533. https://doi.org/10.1016/j.amc.2022.127533
Han, T. , Broersma, H., Bai, Y., & Zhang, S. (2023). Sufficient conditions for properly colored C3’s and C4’s in edge-colored complete graphs. Discrete applied mathematics, 327, 101-109. https://doi.org/10.1016/j.dam.2022.12.020
Liu, X. , Broersma, H. , & Wang, L. (2023). Spectral radius conditions for the existence of all subtrees of diameter at most four. Linear algebra and its applications, 663, 80-101. https://doi.org/10.1016/j.laa.2023.01.004
Li, F., Ye, Q. , Broersma, H. , & Zhang, X. (2023). Polynomial algorithms for computing the isolated toughness of interval and split graphs. Concurrency Computation, 35(17), Article e6345. Advance online publication. https://doi.org/10.1002/cpe.6345
Dai, G., Zhang, Z. B. , Broersma, H. , & Zhang, X. (2022). The Hamiltonian properties in K1,r-free split graphs. Discrete mathematics, 345(6), Article 112826. https://doi.org/10.1016/j.disc.2022.112826
UT Research Information System
Google Scholar Link
Affiliated Study Programmes
Courses Academic Year 2023/2024
Courses in the current academic year are added at the moment they are finalised in the Osiris system. Therefore it is possible that the list is not yet complete for the whole academic year.