Hajo Broersma

ORCID

Publication Activity (10 Years)

Years Active: 1989-2025
Publications (10 Years): 50

Top Venues

Publications

Lin-Peng Zhang, Hajo Broersma, Ligong Wang
Turán numbers of general star forests in hypergraphs. Discret. Math. 348 (1) (2025)
Antonios Antoniadis, Hajo Broersma, Yang Meng
Online Graph Coloring with Predictions. ISCO (2024)
Xiuwen Yang, Hajo Broersma, Ligong Wang
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number. Discret. Appl. Math. 357 (2024)
Yanni Dong, Hajo Broersma, Yuhang Bai, Shenggui Zhang
The complexity of spanning tree problems involving graphical indices. Discret. Appl. Math. 347 (2024)
Xiuwen Yang, Hajo Broersma, Ligong Wang
Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number. Discret. Math. 347 (1) (2024)
Fangfang Wu, Hajo Broersma, Shenggui Zhang, Binlong Li
Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs. J. Graph Theory 105 (1) (2024)
Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu
A note on minimum degree, bipartite holes, and Hamiltonian properties. Discuss. Math. Graph Theory 44 (2) (2024)
Tingting Han, Hajo Broersma, Yandong Bai, Shenggui Zhang
Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs. Discret. Appl. Math. 327 (2023)
Antonios Antoniadis, Hajo Broersma, Yang Meng
Online Graph Coloring with Predictions. CoRR (2023)
Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang
Polynomial algorithms for computing the isolated toughness of interval and split graphs. Concurr. Comput. Pract. Exp. 35 (17) (2023)
Yanni Dong, Hajo Broersma, Changwu Song, Pengfei Wan, Shenggui Zhang
The effect of graph operations on the degree-based entropy. Appl. Math. Comput. 437 (2023)
Xihe Li, Hajo Broersma, Ligong Wang
The Erdős-Gyárfás function with respect to Gallai-colorings. J. Graph Theory 101 (2) (2022)
Xihe Li, Hajo Broersma, Ligong Wang
Integer Colorings with No Rainbow 3-Term Arithmetic Progression. Electron. J. Comb. 29 (2) (2022)
Guowei Dai, Zan-Bo Zhang, Hajo Broersma, Xiaoyan Zhang
-free split graphs. Discret. Math. 345 (6) (2022)
Xiangxiang Liu, Hajo Broersma, Ligong Wang
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees. Discret. Math. 345 (12) (2022)
Fengwei Li, Qingfang Ye, Hajo Broersma
Some New Bounds for the Inverse Sum Indeg Energy of Graphs. Axioms 11 (5) (2022)
Wei Zheng, Hajo Broersma, Ligong Wang
Toughness, forbidden subgraphs, and Hamiltonian-connected graphs. Discuss. Math. Graph Theory 42 (1) (2022)
Hajo Broersma, Qin Ma, Yaping Mao, Jichang Wu
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph. Discuss. Math. Graph Theory 41 (2) (2021)
Wei Zheng, Hajo Broersma, Ligong Wang
On hamiltonicity of 1-tough triangle-free graphs. Electron. J. Graph Theory Appl. 9 (1) (2021)
Dan Hu, Hajo Broersma, Jiangyou Hou, Shenggui Zhang
On the Spectra of General Random Mixed Graphs. Electron. J. Comb. 28 (1) (2021)
Fengwei Li, Qingfang Ye, Hajo Broersma, Ruixuan Ye, Xiao-Yan Zhang
Extremality of VDB topological indices over f-benzenoids with given order. Appl. Math. Comput. 393 (2021)
Hans-Christian Ruiz Euler, Unai Alegre Ibarra, Bram van de Ven, Hajo Broersma, Peter A. Bobbert, Wilfred G. van der Wiel
Dopant network processing units: towards efficient neural network emulators with high-capacity nanoelectronic nodes. Neuromorph. Comput. Eng. 1 (2) (2021)
Wei Zheng, Hajo Broersma, Ligong Wang
Toughness, Forbidden Subgraphs and Pancyclicity. Graphs Comb. 37 (3) (2021)
Xihe Li, Hajo Broersma, Ligong Wang
Extremal problems and results related to Gallai-colorings. Discret. Math. 344 (11) (2021)
Zhiwei Guo, Hajo Broersma, Binlong Li, Shenggui Zhang
Almost eulerian compatible spanning circuits in edge-colored graphs. Discret. Math. 344 (1) (2021)
Ruonan Li, Hajo Broersma, Maho Yokota, Kiyoshi Yoshimoto
Edge-colored complete graphs without properly colored even cycles: A full characterization. J. Graph Theory 98 (1) (2021)
Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu
On sufficient spectral radius conditions for hamiltonicity. Discret. Appl. Math. 296 (2021)
Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu
Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs. Graphs Comb. 37 (6) (2021)
Hans-Christian Ruiz Euler, Unai Alegre Ibarra, Bram van de Ven, Hajo Broersma, Peter A. Bobbert, Wilfred G. van der Wiel
Dopant Network Processing Units: Towards Efficient Neural-network Emulators with High-capacity Nanoelectronic Nodes. CoRR (2020)
Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. J. Comb. Optim. 40 (4) (2020)
Tao Tian, Hajo Broersma, Liming Xiong
On sufficient degree conditions for traceability of claw-free graphs. Discret. Math. 343 (7) (2020)
Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang
Optimal Algorithm of Isolated Toughness for Interval Graphs. PDCAT (2020)
Ruonan Li, Hajo Broersma, Shenggui Zhang
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs. J. Graph Theory 94 (3) (2020)
Wei Zheng, Hajo Broersma, Ligong Wang, Shenggui Zhang
Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs. Discret. Math. 343 (1) (2020)
Tao Chen, Jeroen van Gelder, Bram van de Ven, Sergey V. Amitonov, Bram De Wilde, Hans-Christian Ruiz Euler, Hajo Broersma, Peter A. Bobbert, Floris A. Zwanenburg, Wilfred G. van der Wiel
Classification with a disordered dopant-atom network in silicon. Nat. 577 (7790) (2020)
Ruonan Li, Hajo Broersma, Shenggui Zhang
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs. Graphs Comb. 35 (1) (2019)
Fengwei Li, Xiaoyan Zhang, Hajo Broersma
A polynomial algorithm for weighted scattering number in interval graphs. Discret. Appl. Math. 264 (2019)
Antoon H. Boode, Hajo Broersma
Decompositions of graphs based on a new graph product. Discret. Appl. Math. 259 (2019)
Fengwei Li, Hajo Broersma, Juan Rada, Yuefang Sun
Extremal benzenoid systems for two modified versions of the Randić index. Appl. Math. Comput. 337 (2018)
Binlong Li, Hajo Broersma, Shenggui Zhang
Conditions for graphs to be path partition optimal. Discret. Math. 341 (5) (2018)
Hajo Broersma, Susan Stepney, Göran Wendin
Computability and Complexity of Unconventional Computing Devices. CoRR (2017)
Zan-Bo Zhang, Xiaoyan Zhang, Hajo Broersma, Dingjun Lou
Extremal and Degree Conditions for Path Extendability in Digraphs. SIAM J. Discret. Math. 31 (3) (2017)
Binlong Li, Yanbo Zhang, Hajo Broersma
An Exact Formula for all Star-Kipas Ramsey Numbers. Graphs Comb. 33 (1) (2017)
Ruonan Li, Hajo Broersma, Chuandong Xu, Shenggui Zhang
Cycle extension in edge-colored complete graphs. Discret. Math. 340 (6) (2017)
Ruud van Damme, Hajo Broersma, Julia Mikhal, Celestine Lawrence, Wilfred G. van der Wiel
A simulation tool for evolving functionalities in disordered nanoparticle networks. CEC (2016)
Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen
On the complexity of edge-colored subgraph partitioning problems in network optimization. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Hajo Broersma, Binlong Li, Shenggui Zhang
Forbidden subgraphs for hamiltonicity of 1-tough graphs. Discuss. Math. Graph Theory 36 (4) (2016)
Yanbo Zhang, Hajo Broersma, Yaojun Chen
On fan-wheel and tree-wheel Ramsey numbers. Discret. Math. 339 (9) (2016)
Xiaodong Chen, Mingchu Li, Wei Liao, Hajo Broersma
Hamiltonian properties of almost locally connected claw-free graphs. Ars Comb. 124 (2016)
Yanbo Zhang, Hajo Broersma, Yaojun Chen
On star-critical and upper size Ramsey numbers. Discret. Appl. Math. 202 (2016)
Julian Francis Miller, Hajo Broersma
Computational Matter: Evolving Computational Solutions in Materials. GECCO (Companion) (2015)
Binlong Li, Yanbo Zhang, Halina Bielak, Hajo Broersma, Premek Holub
Closing the Gap on Path-Kipas Ramsey Numbers. Electron. J. Comb. 22 (3) (2015)
Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang
Characterizing Heavy Subgraph Pairs for Pancyclicity. Graphs Comb. 31 (3) (2015)
Hajo Broersma
How tough is toughness? Bull. EATCS 117 (2015)
Limin Wang, Xiaoyan Zhang, Zhao Zhang, Hajo Broersma
A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs. Theor. Comput. Sci. 571 (2015)
Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. 31 (1) (2015)
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory 79 (4) (2015)
Antoon H. Boode, Hajo Broersma, Jan F. Broenink
On a directed tree problem motivated by a newly introduced graph product. Electron. J. Graph Theory Appl. 3 (2) (2015)
Yanbo Zhang, Hajo Broersma, Yaojun Chen
Ramsey numbers of trees versus fans. Discret. Math. 338 (6) (2015)
Yanbo Zhang, Hajo Broersma, Yaojun Chen
Three Results on Cycle-Wheel Ramsey Numbers. Graphs Comb. 31 (6) (2015)
Hajo Broersma, Binlong Li, Shenggui Zhang
Heavy subgraph pairs for traceability of block-chains. Discuss. Math. Graph Theory 34 (2) (2014)
Hajo Broersma, Viresh Patel, Artem V. Pyatkin
-Free Graphs. J. Graph Theory 75 (3) (2014)
Jichang Wu, Hajo Broersma, Haiyan Kang
Removable Edges and Chords of Longest Cycles in 3-Connected Graphs. Graphs Comb. 30 (3) (2014)
Yanbo Zhang, Hajo Broersma, Yaojun Chen
A remark on star-C4 and wheel-C4 Ramsey numbers. Electron. J. Graph Theory Appl. 2 (2) (2014)
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34 (3) (2013)
Binlong Li, Hajo Broersma, Shenggui Zhang
Forbidden subgraph pairs for traceability of block-chains. Electron. J. Graph Theory Appl. 1 (1) (2013)
Antoon H. Boode, Hajo Broersma, Jan F. Broenink
Improving the Performance of Periodic Real-time Processes: a Graph Theoretical Approach. CPA (2013)
Robert de Groote, Philip K. F. Hölzenspies, Jan Kuper, Hajo Broersma
Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs. MEMOCODE (2013)
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65 (1) (2013)
Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
Fully decomposable split graphs. Eur. J. Comb. 34 (3) (2013)
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs CoRR (2013)
Hajo Broersma, Petr A. Golovach, Viresh Patel
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485 (2013)
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG (2013)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
-free graphs in polynomial time. Theor. Comput. Sci. 423 (2012)
Binlong Li, Hajo Broersma, Shenggui Zhang
Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discret. Math. 312 (18) (2012)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414 (1) (2012)
Hajo Broersma, Faustino J. Gomez, Julian F. Miller, Mike Petty, Gunnar Tufte
Nascence Project: Nanoscale Engineering for Novel Computation Using Evolution. Int. J. Unconv. Comput. 8 (4) (2012)
Robert de Groote, Jan Kuper, Hajo Broersma, Gerard J. M. Smit
Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs. EUROMICRO-SEAA (2012)
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14 (2012)
Mingchu Li, Xiaodong Chen, Hajo Broersma
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. J. Graph Theory 68 (4) (2011)
Hajo Broersma, Petr A. Golovach, Viresh Patel
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC (2011)
Hajo Broersma, Daniël Paulusma
Computing sharp 2-factors in claw-free graphs. J. Discrete Algorithms 8 (3) (2010)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
-Free Graphs. WG (2010)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
On Coloring Graphs without Induced Forests. ISAAC (2) (2010)
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
Editorial. J. Discrete Algorithms 8 (2) (2010)
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
The Complexity Status of Problems Related to Sparsest Cuts. IWOCA (2010)
Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
Fully Decomposable Split Graphs. IWOCA (2009)
Hajo Broersma, Elkin Vumar
-dominated graphs. Math. Methods Oper. Res. 69 (2) (2009)
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
Editorial. J. Discrete Algorithms 7 (2) (2009)
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG (2009)
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
-Free Graphs. IWOCA (2009)
Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discuss. Math. Graph Theory 29 (1) (2009)
Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma
Complexity of conditional colorability of graphs. Appl. Math. Lett. 22 (3) (2009)
Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. Graphs Comb. 25 (4) (2009)
Hajo Broersma, Matthew Johnson, Daniël Paulusma
Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410 (14) (2009)
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
Preface. J. Discrete Algorithms 6 (4) (2008)
Hajo Broersma, Agostino Capponi, Daniël Paulusma
A New Algorithm for On-line Coloring Bipartite Graphs. SIAM J. Discret. Math. 22 (1) (2008)
Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still
Some families of integral graphs. Discret. Math. 308 (24) (2008)
Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393 (1-3) (2008)
Hajo Broersma, Daniël Paulusma
Computing Sharp 2-Factors in Claw-Free Graphs. MFCS (2008)

Hajo Broersma.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hajo Broersma