H
Hajo Broersma
Researcher at University of Twente
Publications - 176
Citations - 2121
Hajo Broersma is an academic researcher from University of Twente. The author has contributed to research in topics: Chordal graph & Pathwidth. The author has an hindex of 24, co-authored 162 publications receiving 1859 citations. Previous affiliations of Hajo Broersma include MESA+ Institute for Nanotechnology & Durham University.
Papers
More filters
Journal ArticleDOI
Evolution of a designless nanoparticle network into reconfigurable Boolean logic
S. K. Bose,Celestine Preetham Lawrence,Zhihua Liu,K. S. Makarenko,R.M.J. van Damme,Hajo Broersma,W.G. van der Wiel +6 more
TL;DR: This system artificially evolve the electrical properties of a disordered nanomaterials system to perform computational tasks reconfigurably and meets the criteria for the physical realization of (cellular) neural networks: universality, compactness, robustness and evolvability, which implies scalability to perform more advanced tasks.
Journal ArticleDOI
Independent Sets in Asteroidal Triple-Free Graphs
TL;DR: It is shown that there is an O(n4) time algorithm to compute the maximum weight of an independent set for AT-free graphs, and that the problems CLIQUE and PARTITION INTO CLIQUES remain NP-complete when restricted to AT- free graphs.
Journal ArticleDOI
Paths and cycles in colored graphs
TL;DR: In this note, some sufficient conditions for the existence of monochromatic and heterochromatics paths and cycles are obtained and a conjecture on theexistence of paths andcycles with many colors is proposed.
Journal ArticleDOI
Updating the complexity status of coloring graphs without a fixed induced linear forest
TL;DR: A complete complexity classification of (precoloring extension of) 3-Coloring for H-free graphs when H is a fixed graph on at most 6 vertices: the problem is polynomial-time solvable if H is an linear forest; otherwise it is NP-complete.
Journal Article
Stars and bunches in planar graphs. Part II: General planar graphs and colourings
TL;DR: The structure of plane graphs in terms of stars and bunches was studied in this article, where it was shown that a plane graph contains a $(d-1)$-star centred at a vertex of degree $d\leq5$ and the sum of the degrees of the vertices in the star is bounded.