About Me
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.
Expertise
Mathematics
# Claw-Free Graphs
# Connected Graph
# Degree Condition
# Edge-Colored Graph
# Forbidden Subgraph
# Graph In Graph Theory
# Hamiltonicity
# Toughness
Organisations
Research
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.
Publications
Recent
Ruiz Euler, H-C.
, Alegre Ibarra, U.
, van de Ven, B.
, Broersma, H.
, Bobbert, P. A.
, & van der Wiel, W. G. (2021).
Dopant Network Processing Units: Towards Efficient Neural-network Emulators with High-capacity Nanoelectronic Nodes.
Neuromorphic Computing and Engineering,
1(2), [024002].
https://doi.org/10.1088/2634-4386/ac1a7f
Zheng, W.
, Broersma, H.
, & Wang, L. (2021).
On hamiltonicity of 1-tough triangle-free graphs.
Electronic journal of graph theory and applications,
9(2), 433-441.
https://doi.org/10.5614/ejgta.2021.9.2.15
Li, F., Ye, Q.
, Broersma, H.
, & Zhang, X. (2021).
Polynomial algorithms for computing the isolated toughness of interval and split graphs.
Concurrency Computation, [e6345].
https://doi.org/10.1002/cpe.6345
Li, X. (2021).
Gallai-Ramsey numbers for graphs and their generalizations. University of Twente.
https://doi.org/10.3990/1.9789036552486
Guo, Z.
, Broersma, H.
, Li, B., & Zhang, S. (2021).
Almost eulerian compatible spanning circuits in edge-colored graphs.
Discrete mathematics,
344(1), [112174].
https://doi.org/10.1016/j.disc.2020.112174
Li, F., Ye, Q.
, Broersma, H., Ye, R.
, & Zhang, X. (2021).
Extremality of VDB topological indices over f–benzenoids with given order.
Applied mathematics and computation,
393, [125757].
https://doi.org/10.1016/j.amc.2020.125757
Hu, D.
, Broersma, H., Hou, J., & Zhang, S. (2021).
On the spectra of general random mixed graphs.
Electronic journal of combinatorics,
28(1), [P1.3].
https://doi.org/10.37236/9638
Wu, J.
, Broersma, H., Mao, Y., & Ma, Q. (2021).
Removable Edges on a Hamilton Cycle or Outside a Cycle in a 4-Connected Graph.
Discussiones Mathematicae - Graph Theory,
41(2), 559-587.
https://doi.org/10.7151/dmgt.2209
Li, F., Ye, Q.
, Broersma, H., & Ye, R. (2021).
Sharp upper bounds for augmented zagreb index of graphs with fixed parameters.
Match,
85(2), 257-274.
Zheng, W.
, Broersma, H.
, & Wang, L. (2021).
Toughness, Forbidden Subgraphs and Pancyclicity.
Graphs and combinatorics,
37, 839-866.
https://doi.org/10.1007/s00373-021-02284-y
UT Research Information System
Google Scholar Link
Courses Academic Year 2021/2022
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.
Courses Academic Year 2020/2021
Contact Details
Visiting Address
University of Twente
Faculty of Electrical Engineering, Mathematics and Computer Science
Zilverling
(building no. 11), room 3122
Hallenweg 19
7522NH Enschede
The Netherlands
Mailing Address
University of Twente
Faculty of Electrical Engineering, Mathematics and Computer Science
Zilverling
3122
P.O. Box 217
7500 AE Enschede
The Netherlands
Organisations
Additional Contact Information
Due to Covid-19, I mainly work from home.
I am not participating in any social media.