Hajo Broersma
Cited by
Cited by
Not every 2-tough graph is hamiltonian
D Bauer, HJ Broersma, HJ Veldman
Discrete Applied Mathematics 99 (1-3), 317-321, 2000
Toughness in graphs–a survey
D Bauer, H Broersma, E Schmeichel
Graphs and Combinatorics 22 (1), 1-35, 2006
Evolution of a designless nanoparticle network into reconfigurable Boolean logic
SK Bose, CP Lawrence, Z Liu, KS Makarenko, RMJ van Damme, ...
Nature nanotechnology 10 (12), 1048-1052, 2015
Independent sets in asteroidal triple-free graphs
H Broersma, T Kloks, D Kratsch, H Müller
SIAM Journal on Discrete Mathematics 12 (2), 276-287, 1999
Paths and cycles in colored graphs.
H Broersma, X Li, GJ Woeginger, S Zhang
Australas. J Comb. 31, 299-312, 2005
Stars and bunches in planar graphs (part Ⅱ): general planar graphs and colorings
OV Borodin, HJ Broersma, A Glebov, J Van Den Iteuvel
Diskret Anal Issled Oper Ser 1, 8, 2001
Run-time assignment of tasks to multiple heterogeneous processors
LT Smit, GJM Smit, JL Hurink, H Broersma, D Paulusma, PT Wolkotte
Proceedings of the 4rd PROGRESS workshop on embedded systems, 185-192, 2004
Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of K1, 3-free graphs
HJ Broersma, HJ Veldman
Festschrift in honour of Klaus Wagner, 1990
Path graphs
HJ Broersma, C Hoede
Journal of graph theory 13 (4), 427-444, 1989
Spanning trees with many or few colors in edge-colored graphs
H Broersma, X Li
Discussiones Mathematicae Graph Theory 17 (2), 259-269, 1997
A graph covering algorithm for a coarse grain reconfigurable system
Y Guo, GJM Smit, H Broersma, PM Heysters
ACM SIGPLAN Notices 38 (7), 199-208, 2003
Updating the complexity status of coloring graphs without a fixed induced linear forest
H Broersma, PA Golovach, D Paulusma, J Song
Theoretical computer science 414 (1), 9-19, 2012
Independence trees and Hamilton cycles
H Broersma, H Tuinstra
Journal of graph theory 29 (4), 227-237, 1998
Three Complexity Results on Coloring P k -Free Graphs
H Broersma, FV Fomin, PA Golovach, D Paulusma
International Workshop on Combinatorial Algorithms, 95-104, 2009
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture
LT Smit, GJM Smit, JL Hurink, H Broersma, D Paulusma, PT Wolkotte
Proceedings. 2004 IEEE International Conference on Field-Programmable …, 2004
Backbone colorings for graphs: tree and path backbones
H Broersma, FV Fomin, PA Golovach, GJ Woeginger
Journal of Graph Theory 55 (2), 137-152, 2007
On factors of 4‐connected claw‐free graphs
HJ Broersma, M Kriesell, Z Ryjácek
Journal of graph theory 37 (2), 125-136, 2001
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
HJ Broersma, E Dahlhaus, T Kloks
Discrete Applied Mathematics 99 (1-3), 367-400, 2000
A generalization of a result of Häggkvist and Nicoghossian
D Bauer, HJ Broersma, HJ Veldman, L Rao
Journal of Combinatorial Theory, Series B 47 (2), 237-243, 1989
Nascence project: Nanoscale engineering for novel computation using evolution
HJ Broersma, F Gomez, J Miller, M Petty, G Tufte
International journal of unconventional computing 8 (4), 313-317, 2012
The system can't perform the operation now. Try again later.
Articles 1–20