No photo of Hajo Broersma

Hajo Broersma

prof.dr.ir.

1987 …2018
If you made any changes in Pure these will be visible here soon.

Research Output 1987 2018

2018

Conditions for graphs to be path partition optimal

Li, B., Broersma, H. & Zhang, S. 2018 In : Discrete mathematics. 341, 5, p. 1350-1358 9 p.

Research output: Contribution to journalArticle

Optimal Partition
Hamiltonians
Path
Partition
Graph in graph theory

Evolution in Nanomaterio: The NASCENCE Project

Broersma, H. 2018 Inspired by Nature: Essays Presented to Julian F. Miller on the Occasion of his 60th Birthday. Stepney, S. & Adamatzky, A. (eds.). Cham: Springer International Publishing Switzerland, p. 87-111 25 p. (Emergence, Complexity and Computation; vol. 28)

Research output: Chapter in Book/Report/Conference proceedingChapter

File
dials
readers
nanotechnology
carbon nanotubes
nanoparticles

Evolving Networks To Have Intelligence Realized At Nanoscale

Lawrence, C. P. 16 May 2018 Enschede. 84 p.

Research output: ThesisPhD Thesis - Research UT, graduation UT

Open Access
File
Binary images
Nanostructured materials
Pattern recognition
Demonstrations
Physics

On the automation of periodic hard real-time processes: a graph-theoretical approach

Boode, A. H. 6 Jun 2018 1 ed. Enschede. 154 p.

Research output: ThesisPhD Thesis - Research UT, graduation UT

Open Access
File
Real time control
Automation
Real-time
Graph in graph theory
Switches

Properly colored cycles in edge-colored graphs

Li, R. 18 Jan 2018 Enschede. 153 p.

Research output: ThesisPhD Thesis - Research UT, graduation UT

Open Access
File
Edge-colored Graph
Cycle
Degree Condition
Directed Graph
Complete Bipartite Graph
2017

An exact formula for all star-kipas Ramsey numbers

Li, B., Zhang, Y. & Broersma, H. Jan 2017 In : Graphs and combinatorics. 33, 1, p. 141-148 8 p.

Research output: Contribution to journalArticle

Open Access
File
Ramsey number
Stars
Star
Wheel
Wheels

Cycle extension in edge-colored complete graphs

Li, R., Broersma, H. J., Xu, C. & Zhang, S. Jun 2017 In : Discrete mathematics. 340, 6, p. 1235-1241

Research output: Contribution to journalArticle

Extremal and Degree Conditions for Path Extendability in Digraphs

Zhang, Z-B., Zhang, X., Broersma, H. & Lou, D. 2017 In : SIAM J. Discrete Math.. 31, 3, p. 1990-2014 25 p.

Research output: Contribution to journalArticle

Degree Condition
Extendability
Digraph
Path
Cycle

Paths, cycles and related partitioning problems in graphs

Zhang, Z. 1 Sep 2017 Enschede. 155 p.

Research output: ThesisPhD Thesis - Research UT, graduation UT

Open Access
File
Extendability
Partitioning
Cycle
Path
Tournament

Using neural networks to predict the functionality of reconfigurable nano-material networks

Greff, K., van Damme, R. M. J., Koutnik, J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P., van der Wiel, W. G. & Schmidhuber, J. 10 Jan 2017 In : International journal on advances in intelligent systems. 9, 3&4, p. 339-351 13 p.

Research output: Contribution to journalArticle

Open Access
File
Neural networks
Logic gates
Experiments
Transfer functions
Physical properties
2016

A simulation tool for evolving functionalities in disordered nanoparticle networks

van Damme, R. M. J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P. & van der Wiel, W. G. 21 Nov 2016 2016 IEEE Congress on Evolutionary Computation (CEC 2016). USA: IEEE Computer Society, p. 5238-5245 8 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Computational matter: evolving computational functions in nanoscale materials

Broersma, H. J., Miller, J. F. & Nichele, S. 2016 Advances in Unconventional Computing, Volume 2: Prototypes, Models and Algorithms. Adamatzky, A. (ed.). London: Springer, p. 397-428 32 p. (Emergence, Complexity and Computation; vol. 23, no. 23)

Research output: Chapter in Book/Report/Conference proceedingChapter

Forbidden subgraphs for hamiltonicity of 1-tough graphs

Broersma, H. J., Li, B. & Zhang, S. Oct 2016 In : Discussiones mathematicae. Graph theory. 36, 4, p. 915-929 15 p.

Research output: Contribution to journalArticle

Hamiltonian properties of almost locally connected claw-free graphs

Chen, X., Li, M., Liao, W. & Broersma, H. J. Jan 2016 In : Ars combinatoria. 124, p. 95-109 15 p.

Research output: Contribution to journalArticle

Narrowing down the gap on cycle-star Ramsey numbers

Zhang, Y., Broersma, H. J. & Chen, Y. Feb 2016 In : Journal of combinatorics (Somerville). 7, 2-3, p. 481-493 13 p.

Research output: Contribution to journalArticle

On fan-wheel and tree-wheel Ramsey numbers

Zhang, Y., Zhang, Y., Broersma, H. J. & Chen, Y. 6 Sep 2016 In : Discrete mathematics. 339, 9, p. 2284-2287 7 p.

Research output: Contribution to journalArticle

1 Citations

On star-critical and upper size Ramsey numbers

Zhang, Y., Broersma, H. J. & Chen, Y. 31 Mar 2016 In : Discrete applied mathematics. 202, p. 174-180 7 p.

Research output: Contribution to journalArticle

Ramsey number
Hooks
Stars
Star
Graph in graph theory

On the complexity of edge-colored subgraph partitioning problems in network optimization

Zhang, X., Zhang, Z., Broersma, H. J. & Wen, X. Jul 2016 In : Discrete mathematics and theoretical computer science. 17, 3, p. 227-244 18 p.

Research output: Contribution to journalArticle

Unconventional computing using evolution-in-nanomaterio: neural networks meet nanoparticle networks

Greff, K., van Damme, R. M. J., Koutnik, J., Broersma, H. J., Mikhal, J. O., Lawrence, C. P., van der Wiel, W. G. & Schmidhuber, J. 20 Mar 2016 The Eighth International Conference on Future Computational Technologies and Applications, FUTURE COMPUTING 2016. Wilmington, U.S.A.: IARIA International Academy, Research and Industry Association, p. 15-20 6 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
2015

A note on Ramsey numbers for fans

Zhang, Y., Broersma, H. J. & Chen, Y. Aug 2015 In : Bulletin of the Australian Mathematical Society. 92, 1, p. 19-23 5 p.

Research output: Contribution to journalArticle

File
6 Citations

A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs

Wang, L., Zhang, X., Zhang, X., Zhang, Z. & Broersma, H. J. Mar 2015 In : Theoretical computer science. 571, p. 58-66 9 p.

Research output: Contribution to journalArticle

9 Citations

Best monotone degree conditions for graph properties: a survey

Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N., Nevo, A., Schmeichel, E., Woodall, D. R. & Yatauro, M. Jan 2015 In : Graphs and combinatorics. 31, 1, p. 1-22 22 p.

Research output: Contribution to journalArticle

1 Citations

Characterizing heavy subgraph pairs for pancyclicity

Li, B., Ning, B., Broersma, H. J. & Zhang, S. May 2015 In : Graphs and combinatorics. 31, 3, p. 649-667 19 p.

Research output: Contribution to journalArticle

Closing the gap on path-kipas Ramsey numbers

Li, B., Zhang, Y., Bielak, H., Broersma, H. J. & Holub, P. 14 Aug 2015 In : Electronic journal of combinatorics. 22, 3, p. 3.21 8 p.

Research output: Contribution to journalArticle

File

Computational matter: evolving computational solutions in materials

Miller, J. F. & Broersma, H. J. 11 Jul 2015 Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO Companion 2015. Silva, S. (ed.). New York: Association for Computing Machinery, p. 769-770 2 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
25 Citations

Evolution of a designless nanoparticle network into reconfigurable Boolean logic

Bose, S., Lawrence, C. P., Liu, Z., Makarenko, K. S., van Damme, R. M. J., Broersma, H. J. & van der Wiel, W. G. Dec 2015 In : Nature nanotechnology. 10, 12, p. 1048-1052 5 p.

Research output: Contribution to journalArticle

Generalized Ramsey numbers for graphs

Zhang, Y. 13 Mar 2015 Enschede, The Netherlands: Universiteit Twente. 159 p.

Research output: ThesisPhD Thesis - Research UT, graduation UT

File

How tough is toughness?

Broersma, H. J. Oct 2015 In : Bulletin of the European Association for Theoretical Computer Science. 117, p. 28-52 25 p.

Research output: Contribution to journalArticle

File
3 Citations

Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs

Broersma, H. J., Fiala, J., Golovach, P. A., Kaiser, T., Paulusma, D. & Proskurowski, A. Aug 2015 In : Journal of graph theory. 79, 4, p. 282-299 18 p.

Research output: Contribution to journalArticle

File
File
1 Citations

Ramsey numbers of trees versus fans

Zhang, Y., Broersma, H. J. & Chen, Y. Jun 2015 In : Discrete mathematics. 338, 6, p. 994-999 6 p.

Research output: Contribution to journalArticle

File

Three results on cycle-wheel Ramsey numbers

Zhang, Y., Broersma, H. J. & Chen, Y. Nov 2015 In : Graphs and combinatorics. 31, 6, p. 2467-2479 13 p.

Research output: Contribution to journalArticle

File
2014

Algorithmic and structural aspects of graph partitioning and related problems

Zhang, X. 9 May 2014 Enschede: Universiteit Twente. 158 p.

Research output: ThesisPhD Thesis - Research UT, graduation UT

File

A remark on star-C4 and wheel-C4 Ramsey numbers

Zhang, Y., Broersma, H. J. & Chen, Y. 2014 In : Electronic journal of graph theory and applications. 2, 2, p. 110-114 5 p.

Research output: Contribution to journalArticle

1 Citations

Heavy subgraph pairs for traceability of block-chains

Li, B., Li, B., Broersma, H. J. & Zhang, S. 2014 In : Discussiones mathematicae. Graph theory. 34, 2, p. 287-307 21 p.

Research output: Contribution to journalArticle

File
4 Citations

On toughness and hamiltonicity of 2K2-free graphs

Broersma, H. J., Patel, V. & Pyatkin, A. Mar 2014 In : Journal of graph theory. 75, 3, p. 244-255 12 p.

Research output: Contribution to journalArticle

1 Citations

Removable edges and chords of longest cycles in 3-connected graphs

Wu, J., Broersma, H. J. & Kang, H. 2014 In : Graphs and combinatorics. 30, 3, p. 743-753 11 p.

Research output: Contribution to journalArticle

2013
10 Citations

Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs

de Groote, R., Holzenspies, P. K. F., Kuper, J. & Broersma, H. J. Oct 2013 Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013. USA: IEEE Computer Society, p. 35-46 12 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
2 Citations

Exact algorithms for finding longest cycles in claw-free graphs

Broersma, H. J., Fomin, F. V., van 't Hof, P. & Paulusma, D. 2013 In : Algorithmica. 65, 1, p. 129-145 17 p.

Research output: Contribution to journalArticle

Forbidden subgraph pairs for traceability of block-chains

Li, B., Li, B., Broersma, H. J. & Zhang, S. 2013 In : Electronic journal of graph theory and applications. 1, 1, p. 1-10 10 p.

Research output: Contribution to journalArticle

2 Citations

Fully decomposable split graphs

Broersma, H. J., Kratsch, D. & Woeginger, G. 2013 In : European journal of combinatorics. 34, 3, p. 567-575 9 p.

Research output: Contribution to journalArticle

File

Improving the performance of periodic real-time processes: a graph theoretical approach

Boode, A. H., Broersma, H. J. & Broenink, J. F. 25 Aug 2013 Communicating Process Architectures 2013. Bicester: Open Channel Publishing Ltd, p. 57-79 23 p. (35th WoTUG conference on concurrent and parallel programming)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

File
1 Citations

Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs

Broersma, H. J., Fiala, J., Golovach, P. A., Kaiser, T., Paulusma, D. & Proskurowski, A. 2013 Graph-Theoretic Concepts in Computer Science: 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers. Brandstädt, A., Jansen, K. & Reischuk, R. (eds.). Berlin: Springer Verlag, p. 127-138 12 p. (Lecture Notes in Computer Science; vol. 8165)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Interval Graphs
Linear-time Algorithm
Connectivity
Scattering
If and only if

Tank-ring factors in supereulerian claw-free graphs

Li, M., Yuan, L., Jiang, H., Liu, B. & Broersma, H. J. 2013 In : Graphs and combinatorics. 29, 3, p. 599-608 10 p.

Research output: Contribution to journalArticle

15 Citations

Three complexity results on coloring $P_k$-free graphs

Broersma, H. J., Fomin, V. V., Golovach, P. A. & Paulusma, D. 2013 In : European journal of combinatorics. 34, 3, p. 609-619 11 p.

Research output: Contribution to journalArticle

File
3 Citations

Tight complexity bounds for FPT subgraph problems parameterized by the clique-width

Broersma, H. J., Golovach, P. A. & Patel, V. 2013 In : Theoretical computer science. 485, p. 69-84 16 p.

Research output: Contribution to journalArticle

3 Citations

Toughness and vertex degrees

Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N. & Schmeichel, E. 2013 In : Journal of graph theory. 72, 2, p. 209-219 11 p.

Research output: Contribution to journalArticle

2012
5 Citations

Degree sequences and the existence of k-factors

Bauer, D., Broersma, H. J., van den Heuvel, J., Kahl, N. & Schmeichel, E. Mar 2012 In : Graphs and combinatorics. 28, 2, p. 149-166 18 p.

Research output: Contribution to journalArticle

File
18 Citations

Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time

Broersma, H. J., Golovach, P. A., Paulusma, D. & Song, J. 16 Mar 2012 In : Theoretical computer science. 423, p. 1-10 10 p.

Research output: Contribution to journalArticle

8 Citations

How many conjectures can you stand: a survey

Broersma, H. J., Ryjáček, Z. & Vrána, P. 2012 In : Graphs and combinatorics. 28, 1, p. 57-75 19 p.

Research output: Contribution to journalArticle

File