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

Filter
Article
2019
1 Citation (Scopus)
24 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

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
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
199 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
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

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

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

File
42 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

104 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
7 Citations (Scopus)
10 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
32 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

File
1 Citation (Scopus)
14 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

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)
41 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
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)
8 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

File

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

17 Citations (Scopus)
8 Downloads (Pure)

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

File
4 Citations (Scopus)

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

3 Citations (Scopus)

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

2012
6 Citations (Scopus)
16 Downloads (Pure)

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

File
21 Citations (Scopus)

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

9 Citations (Scopus)
39 Downloads (Pure)

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

File
28 Citations (Scopus)
1 Downloads (Pure)

Nascence project: nanoscale engineering for novel computation using evolution

Broersma, H. J., Gomez, F., Miller, J., Petty, M. & Tufte, G., 2012, In : International journal of unconventional computing. 8, 4, p. 313-317 5 p.

Research output: Contribution to journalArticleAcademic

1 Citation (Scopus)
25 Downloads (Pure)

Pairs of forbidden induced subgraphs for homogeneously traceable graphs

Li, B., Li, B., Broersma, H. J. & Zhang, S., Sep 2012, In : Discrete mathematics. 312, 18, p. 2800-2818 19 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File

The complexity of finding uniform sparsest cuts in various graph classes

Bonsma, P. S., Broersma, H. J., Patel, V. & Pyatkin, A. V., 2012, In : Journal of discrete algorithms. 14, p. 136-149 14 p.

Research output: Contribution to journalArticleAcademicpeer-review

34 Citations (Scopus)

Updating the complexity status of coloring graphs without a fixed induced linear forest

Broersma, H. J., Golovach, P. A., Paulusma, D. & Song, J., 13 Jan 2012, In : Theoretical computer science. 414, 1, p. 9-19 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

2011
4 Citations (Scopus)

Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs

Li, M., Chen, X. & Broersma, H. J., Dec 2011, In : Journal of graph theory. 68, 4, p. 285-298 14 p.

Research output: Contribution to journalArticleAcademicpeer-review

2010
3 Citations (Scopus)

Computing sharp 2-factors in claw-free graphs

Broersma, H. J. & Paulusma, D., Sep 2010, In : Journal of discrete algorithms. 8, 3, p. 321-329 9 p., 10.1016/j.jda.2009.07.001.

Research output: Contribution to journalArticleAcademicpeer-review

2009
9 Citations (Scopus)
16 Downloads (Pure)

Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number

Broersma, H. J., Marchal, B., Paulusma, D. & Salman, M., Mar 2009, In : Discussiones mathematicae. Graph theory. 29, 1, p. 143-162 20 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
15 Citations (Scopus)

Complexity of conditional colorability of graphs

Li, X., Li, X., Yao, X., Zhou, W. & Broersma, H. J., Mar 2009, In : Applied mathematics letters. 22, 3, p. 320-324 5 p.

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)

On hamiltonicity of P3-dominated graphs

Broersma, H. J. & Vumar, E., May 2009, In : Mathematical methods of operations research. 69, 2, p. 297-306 10 p., 10.1007/s00186-008-0260-7.

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)

Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs

Broersma, H. J., Paulusma, D. & Yoshimoto, K., 2009, In : Graphs and combinatorics. 25, 4, p. 427-460 34 p., 10.1007/s00373-009-0855-7.

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)

Upper bounds and algorithms for parallel knock-out numbers

Broersma, H. J., Johnson, M., Paulusma, D. & Stewart, I. A., Mar 2009, In : Theoretical computer science. 410, 14, p. 1319-1327 9 p., 10.1016/j.tcs.2008.03.024.

Research output: Contribution to journalArticleAcademicpeer-review

16 Citations (Scopus)

λ-backbone colorings along pairwise disjoint stars and matchings

Broersma, H. J., Fujisawa, J., Marchal, L., Paulusma, D., Salman, M. & Yoshimoto, K., 28 Sep 2009, In : Discrete mathematics. 309, 18, p. 5596-5609 14 p., 10.1016/j.disc.2008.04.007.

Research output: Contribution to journalArticleAcademicpeer-review

2008
13 Citations (Scopus)

A new algorithm for on-line coloring bipartite graphs

Broersma, H. J., Capponi, A. & Paulusma, D., Feb 2008, In : SIAM journal on discrete mathematics. 22, WoTUG-31/1, p. 72-91 20 p., 10.1137/060668675.

Research output: Contribution to journalArticleAcademicpeer-review