Welkom...

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

Hoogleraar

Expertises

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

Publicaties

Recente Artikelen
Li, R., Broersma, H. J., Xu, C., & Zhang, S. (2017). Cycle extension in edge-colored complete graphs. Discrete mathematics, 340(6), 1235-1241. DOI: 10.1016/j.disc.2017.01.023
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.

Pure Link

Contactgegevens

Bezoekadres

Universiteit Twente
Faculteit Elektrotechniek, Wiskunde en Informatica
Zilverling (gebouwnr. 11), kamer 3102
Hallenweg 19
7522NH  Enschede

Navigeer naar locatie

Postadres

Universiteit Twente
Faculteit Elektrotechniek, Wiskunde en Informatica
Zilverling  3102
Postbus 217
7500 AE Enschede