No photo of Hajo Broersma

Hajo Broersma

prof.dr.ir.

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

Research Output 1987 2019

2019
12 Downloads (Pure)

Degree, Toughness and Subgraph Conditions for Hamiltonian Properties of Graphs

Zheng, W., 2019, Enschede: University of Twente. 149 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

Open Access
File
Toughness
Subgraph
Graph in graph theory
Hamilton Cycle
Graph theory
1 Citation (Scopus)
31 Downloads (Pure)

Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs

Li, R., Broersma, H. & Zhang, S., 2 Jan 2019, In : Graphs and combinatorics. 35, 1, p. 261-286 26 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Edge-colored Graph
Directed graphs
Complete Graph
Graph in graph theory
Multipartite Tournaments
2018
2 Citations (Scopus)
1 Downloads (Pure)

Computability and Complexity of Unconventional Computing Devices

Broersma, H., Stepney, S. & Wendin, G., 20 Jul 2018, Computational Matter. p. 185-229 45 p. (Natural Computing Series).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Computability
Turing
Computing
Polynomial time
NP-complete problem

Conditions for graphs to be path partition optimal

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

Research output: Contribution to journalArticleAcademicpeer-review

Optimal Partition
Hamiltonians
Path
Partition
Graph in graph theory
74 Downloads (Pure)

Degree Conditions for Hamiltonian Properties of Claw-free Graphs

Tian, T., 5 Sep 2018, Enschede: Ipskamp Printing. 131 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

Open Access
File
Degree Condition
Claw-free Graphs
Minimum Degree
Degree Sum
Hamilton Path
54 Downloads (Pure)

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, p. 87-111 25 p. (Emergence, Complexity and Computation; vol. 28).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

File
dials
readers
nanotechnology
carbon nanotubes
nanoparticles
162 Downloads (Pure)

Evolving Networks To Have Intelligence Realized At Nanoscale

Lawrence, C. P., 16 May 2018, Enschede: University of Twente. 84 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

Open Access
File
Binary images
Nanostructured materials
Pattern recognition
Demonstrations
Physics
46 Downloads (Pure)

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

Boode, A. H., 6 Jun 2018, 1 ed. Enschede: University of Twente. 154 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

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

Philosophy of Computation

Konkoli, Z., Stepney, S., Broersma, H., Dini, P., Nehaniv, C. L. & Nichele, S., 20 Jul 2018, Computational Matter. Springer, p. 153-184 (Computational Matter).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

information processing
machinery
rock
trend
66 Downloads (Pure)

Properly colored cycles in edge-colored graphs

Li, R., 18 Jan 2018, Enschede: University of Twente. 153 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

Open Access
File
Edge-colored Graph
Cycle
Degree Condition
Directed Graph
Complete Bipartite Graph
123 Downloads (Pure)

The spectral analysis of random graph matrices

Hu, D., 5 Sep 2018, Enschede: Ipskamp Printing. 162 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

Open Access
File
Spectral Analysis
Random Graphs
Mixed Graphs
Hermitian matrix
Adjacency Matrix
2017
1 Citation (Scopus)
11 Downloads (Pure)

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 journalArticleAcademicpeer-review

Open Access
File
Ramsey number
Stars
Star
Wheel
Wheels
1 Citation (Scopus)

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 journalArticleAcademicpeer-review

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 journalArticleAcademicpeer-review

Degree Condition
Extendability
Digraph
Path
Cycle
92 Downloads (Pure)

Paths, cycles and related partitioning problems in graphs

Zhang, Z., 1 Sep 2017, Enschede: University of Twente. 155 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

Open Access
File
Extendability
Partitioning
Cycle
Path
Tournament
203 Downloads (Pure)

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 journalArticleAcademicpeer-review

Open Access
File
Neural networks
Logic gates
Experiments
Transfer functions
Physical properties
2016
4 Downloads (Pure)

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 contributionAcademicpeer-review

4 Downloads (Pure)

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 proceedingChapterAcademic

15 Downloads (Pure)

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 journalArticleAcademicpeer-review

6 Downloads (Pure)

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 journalArticleAcademicpeer-review

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 journalArticleAcademicpeer-review

1 Citation (Scopus)

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 journalArticleAcademicpeer-review

Ramsey number
Wheel
Fans
Wheels
Subgraph
3 Citations (Scopus)

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 journalArticleAcademicpeer-review

Ramsey number
Hooks
Stars
Star
Graph in graph theory
2 Citations (Scopus)
3 Downloads (Pure)

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 journalArticleAcademicpeer-review

117 Downloads (Pure)

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, p. 15-20 6 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

File
2015
33 Downloads (Pure)

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 journalArticleAcademicpeer-review

File
7 Citations (Scopus)

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 journalArticleAcademicpeer-review

13 Citations (Scopus)

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 journalArticleAcademicpeer-review

1 Citation (Scopus)

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 journalArticleAcademicpeer-review

1 Citation (Scopus)
18 Downloads (Pure)

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 journalArticleAcademicpeer-review

Open Access
File
11 Downloads (Pure)

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 (ACM), p. 769-770 2 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

File
44 Citations (Scopus)
6 Downloads (Pure)

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 journalArticleAcademicpeer-review

70 Downloads (Pure)

Generalized Ramsey numbers for graphs

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

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

File
124 Downloads (Pure)

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 journalArticleAcademic

File
8 Citations (Scopus)
12 Downloads (Pure)

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 journalArticleAcademicpeer-review

File
35 Downloads (Pure)

On a directed tree problem motivated by a newly introduced graph product

Boode, A. H., Broersma, H. J. & Broenink, J. F., 21 Oct 2015, In : Electronic journal of graph theory and applications. 3, 2, p. 162-181 20 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
2 Citations (Scopus)
19 Downloads (Pure)

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 journalArticleAcademicpeer-review

Open Access
File
1 Citation (Scopus)
19 Downloads (Pure)

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 journalArticleAcademicpeer-review

File
2014
61 Downloads (Pure)

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 UTAcademic

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 journalArticleAcademicpeer-review

1 Citation (Scopus)
49 Downloads (Pure)

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 journalArticleAcademicpeer-review

File
4 Citations (Scopus)

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 journalArticleAcademicpeer-review

2 Citations (Scopus)

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 journalArticleAcademicpeer-review

2013
12 Citations (Scopus)
69 Downloads (Pure)

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 contributionAcademicpeer-review

File
2 Citations (Scopus)

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 journalArticleAcademicpeer-review

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 journalArticleAcademicpeer-review

3 Citations (Scopus)
10 Downloads (Pure)

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 journalArticleAcademicpeer-review

Open Access
File
Split Graph
Decomposable
Graph in graph theory
Decision problem
Polynomial-time Algorithm
22 Downloads (Pure)

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 contributionAcademicpeer-review

File
1 Citation (Scopus)
4 Downloads (Pure)

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, p. 127-138 12 p. (Lecture Notes in Computer Science; vol. 8165).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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 journalArticleAcademicpeer-review