Welcome...

prof.dr.ir. H.J. Broersma (Hajo)

Full Professor

Expertise

Graph In Graph Theory
Cycle
Polynomials
Coloring
Path
Subgraph
Computational Complexity
Claw-Free Graphs

Publications

Recent Articles
Li, B., Zhang, Y., & Broersma, H. J. (2017). An exact formula for all star-kipas Ramsey numbers. Graphs and combinatorics, 33(1), 141-148. DOI: 10.1007/s00373-016-1746-3
Greff, K., van Damme, R. M. J., Koutnik, J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P., ... Schmidhuber, J. (2017). Using neural networks to predict the functionality of reconfigurable nano-material networks. International journal on advances in intelligent systems, 9(3&4), 339-351.
Zhang, Y., Broersma, H. J., & Chen, Y. (2016). Narrowing down the gap on cycle-star Ramsey numbers. Journal of combinatorics (Somerville), 7(2-3), 481-493. DOI: 10.4310/JOC.2016.v7.n2.a13
Zhang, X., Zhang, Z., Broersma, H. J., & Wen, X. (2016). On the complexity of edge-colored subgraph partitioning problems in network optimization. Discrete mathematics and theoretical computer science, 17(3), 227-244.
Chen, X., Li, M., Liao, W., & Broersma, H. J. (2016). Hamiltonian properties of almost locally connected claw-free graphs. Ars combinatoria, 124, 95-109.
Zhang, Y., Zhang, Y., Broersma, H. J., & Chen, Y. (2016). On fan-wheel and tree-wheel Ramsey numbers. Discrete mathematics, 339(9), 2284-2287. DOI: 10.1016/j.disc.2016.03.013
Broersma, H. J., Li, B., & Zhang, S. (2016). Forbidden subgraphs for hamiltonicity of 1-tough graphs. Discussiones mathematicae. Graph theory, 36(4), 915-929. DOI: 10.7151/dmgt.1897
Zhang, Y., Broersma, H. J., & Chen, Y. (2016). On star-critical and upper size Ramsey numbers. Discrete applied mathematics, 202, 174-180. DOI: 10.1016/j.dam.2015.08.020
Greff, K., van Damme, R. M. J., Koutnik, J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P., ... Schmidhuber, J. (2016). Unconventional computing using evolution-in-nanomaterio: neural networks meet nanoparticle networks. In The Eighth International Conference on Future Computational Technologies and Applications, FUTURE COMPUTING 2016 (pp. 15-20). Wilmington, U.S.A.: IARIA International Academy, Research and Industry Association.

UT Research Information System

Contact Details

Visiting Address

University of Twente
Faculty of Electrical Engineering, Mathematics & Computer Science
Zilverling (building no. 11), room 3102
Hallenweg 19
7522NH  Enschede
The Netherlands

Navigate to location

Mailing Address

University of Twente
Faculty of Electrical Engineering, Mathematics & Computer Science
Zilverling  3102
P.O. Box 217
7500 AE Enschede
The Netherlands