Hajo Broersma

190 papers A* 1A 1B 17C 8Journal 148Unranked 11
YearRankTypeTitle / Venue / Authors
2026 J jnl
Incorporating predictions in online graph coloring algorithms.
Discret. Appl. Math.
Antonios Antoniadis, Hajo Broersma, Yang Meng
2026 J jnl
On Turán problems with bounded fractional matching number.
Discret. Math.
Lin-Peng Zhang, Hajo Broersma, Ligong Wang
2026 J jnl
The Turán number of Berge-linear forests in hypergraphs.
Discret. Math.
Lin-Peng Zhang, Hajo Broersma, Ligong Wang
2025 J jnl
An adjacency lemma on signed edge colorings with an application to planar graphs.
Discret. Appl. Math.
Li Zhang, Hajo Broersma, You Lu, Shenggui Zhang
2025 J jnl
Closures and heavy pairs for hamiltonicity.
Discret. Appl. Math.
Wangyi Shang, Hajo Broersma, Shenggui Zhang, Binlong Li
2025 J jnl
Generalized Crowns in Linear $r$-Graphs.
Electron. J. Comb.
Lin-Peng Zhang, Hajo Broersma, Ligong Wang
2025 J jnl
Turán numbers of general star forests in hypergraphs.
Discret. Math.
Lin-Peng Zhang, Hajo Broersma, Ligong Wang
2024 J jnl
A note on minimum degree, bipartite holes, and Hamiltonian properties.
Discuss. Math. Graph Theory
Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu
2024 J jnl
Bounds for the eccentricity spectral radius of join digraphs with a fixed dichromatic number.
Discret. Appl. Math.
Xiuwen Yang, Hajo Broersma, Ligong Wang
2024 J jnl
Growth rates of the bipartite Erdős-Gyárfás function.
J. Graph Theory
Xihe Li, Hajo Broersma, Ligong Wang
2024 C conf
Online Graph Coloring with Predictions.
ISCO
Antonios Antoniadis, Hajo Broersma, Yang Meng
2024 J jnl
Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs.
J. Graph Theory
Fangfang Wu, Hajo Broersma, Shenggui Zhang, Binlong Li
2024 J jnl
Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number.
Discret. Math.
Xiuwen Yang, Hajo Broersma, Ligong Wang
2024 J jnl
The complexity of spanning tree problems involving graphical indices.
Discret. Appl. Math.
Yanni Dong, Hajo Broersma, Yuhang Bai, Shenggui Zhang
2023 J jnl
Online Graph Coloring with Predictions.
CoRR
Antonios Antoniadis, Hajo Broersma, Yang Meng
2023 J jnl
Polynomial algorithms for computing the isolated toughness of interval and split graphs.
Concurr. Comput. Pract. Exp.
Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang
2023 J jnl
Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs.
Discret. Appl. Math.
Tingting Han, Hajo Broersma, Yandong Bai, Shenggui Zhang
2023 J jnl
The effect of graph operations on the degree-based entropy.
Appl. Math. Comput.
Yanni Dong, Hajo Broersma, Changwu Song, Pengfei Wan, Shenggui Zhang
2022 J jnl
Integer Colorings with No Rainbow 3-Term Arithmetic Progression.
Electron. J. Comb.
Xihe Li, Hajo Broersma, Ligong Wang
2022 J jnl
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees.
Discret. Math.
Xiangxiang Liu, Hajo Broersma, Ligong Wang
2022 J jnl
Some New Bounds for the Inverse Sum Indeg Energy of Graphs.
Axioms
Fengwei Li, Qingfang Ye, Hajo Broersma
2022 J jnl
The Erdős-Gyárfás function with respect to Gallai-colorings.
J. Graph Theory
Xihe Li, Hajo Broersma, Ligong Wang
2022 J jnl
The Hamiltonian properties in
Discret. Math.
Guowei Dai, Zan-Bo Zhang, Hajo Broersma, Xiaoyan Zhang
2022 J jnl
Toughness, forbidden subgraphs, and Hamiltonian-connected graphs.
Discuss. Math. Graph Theory
Wei Zheng, Hajo Broersma, Ligong Wang
2021 J jnl
Almost eulerian compatible spanning circuits in edge-colored graphs.
Discret. Math.
Zhiwei Guo, Hajo Broersma, Binlong Li, Shenggui Zhang
2021 J jnl
Dopant network processing units: towards efficient neural network emulators with high-capacity nanoelectronic nodes.
Neuromorph. Comput. Eng.
Hans-Christian Ruiz Euler, Unai Alegre Ibarra, Bram van de Ven, Hajo Broersma, Peter A. Bobbert, Wilfred G. van der Wiel
2021 J jnl
Edge-colored complete graphs without properly colored even cycles: A full characterization.
J. Graph Theory
Ruonan Li, Hajo Broersma, Maho Yokota, Kiyoshi Yoshimoto
2021 J jnl
Extremal problems and results related to Gallai-colorings.
Discret. Math.
Xihe Li, Hajo Broersma, Ligong Wang
2021 J jnl
Extremality of VDB topological indices over f-benzenoids with given order.
Appl. Math. Comput.
Fengwei Li, Qingfang Ye, Hajo Broersma, Ruixuan Ye, Xiao-Yan Zhang
2021 J jnl
On hamiltonicity of 1-tough triangle-free graphs.
Electron. J. Graph Theory Appl.
Wei Zheng, Hajo Broersma, Ligong Wang
2021 J jnl
On sufficient spectral radius conditions for hamiltonicity.
Discret. Appl. Math.
Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu
2021 J jnl
On the Spectra of General Random Mixed Graphs.
Electron. J. Comb.
Dan Hu, Hajo Broersma, Jiangyou Hou, Shenggui Zhang
2021 J jnl
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph.
Discuss. Math. Graph Theory
Hajo Broersma, Qin Ma, Yaping Mao, Jichang Wu
2021 J jnl
Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs.
Graphs Comb.
Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu
2021 J jnl
Toughness, Forbidden Subgraphs and Pancyclicity.
Graphs Comb.
Wei Zheng, Hajo Broersma, Ligong Wang
2020 J jnl
Classification with a disordered dopant-atom network in silicon.
Nat.
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
2020 J jnl
Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs.
Discret. Math.
Wei Zheng, Hajo Broersma, Ligong Wang, Shenggui Zhang
2020 J jnl
Dopant Network Processing Units: Towards Efficient Neural-network Emulators with High-capacity Nanoelectronic Nodes.
CoRR
Hans-Christian Ruiz Euler, Unai Alegre Ibarra, Bram van de Ven, Hajo Broersma, Peter A. Bobbert, Wilfred G. van der Wiel
2020 J jnl
On sufficient degree conditions for traceability of claw-free graphs.
Discret. Math.
Tao Tian, Hajo Broersma, Liming Xiong
2020 C conf
Optimal Algorithm of Isolated Toughness for Interval Graphs.
PDCAT
Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang
2020 J jnl
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs.
J. Comb. Optim.
Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang
2020 J jnl
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs.
J. Graph Theory
Ruonan Li, Hajo Broersma, Shenggui Zhang
2019 J jnl
A polynomial algorithm for weighted scattering number in interval graphs.
Discret. Appl. Math.
Fengwei Li, Xiaoyan Zhang, Hajo Broersma
2019 J jnl
Decompositions of graphs based on a new graph product.
Discret. Appl. Math.
Antoon Hendrik Boode, Hajo Broersma
2019 J jnl
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs.
Graphs Comb.
Ruonan Li, Hajo Broersma, Shenggui Zhang
2018 — ch.
Computability and Complexity of Unconventional Computing Devices.
Computational Matter
Hajo Broersma, Susan Stepney, Göran Wendin
2018 J jnl
Conditions for graphs to be path partition optimal.
Discret. Math.
Binlong Li, Hajo Broersma, Shenggui Zhang
2018 J jnl
Extremal benzenoid systems for two modified versions of the Randić index.
Appl. Math. Comput.
Fengwei Li, Hajo Broersma, Juan Rada, Yuefang Sun
2018 — ch.
Philosophy of Computation.
Computational Matter
Zoran Konkoli, Susan Stepney, Hajo Broersma, Paolo Dini, Chrystopher L. Nehaniv, Stefano Nichele
2017 J jnl
An Exact Formula for all Star-Kipas Ramsey Numbers.
Graphs Comb.
Binlong Li, Yanbo Zhang, Hajo Broersma
2017 J jnl
Computability and Complexity of Unconventional Computing Devices.
CoRR
Hajo Broersma, Susan Stepney, Göran Wendin
2017 J jnl
Cycle extension in edge-colored complete graphs.
Discret. Math.
Ruonan Li, Hajo Broersma, Chuandong Xu, Shenggui Zhang
2017 J jnl
Extremal and Degree Conditions for Path Extendability in Digraphs.
SIAM J. Discret. Math.
Zan-Bo Zhang, Xiaoyan Zhang, Hajo Broersma, Dingjun Lou
2016 B conf
A simulation tool for evolving functionalities in disordered nanoparticle networks.
CEC
Ruud van Damme, Hajo Broersma, Julia Mikhal, Celestine Lawrence, Wilfred G. van der Wiel
2016 J jnl
Forbidden subgraphs for hamiltonicity of 1-tough graphs.
Discuss. Math. Graph Theory
Hajo Broersma, Binlong Li, Shenggui Zhang
2016 J jnl
Hamiltonian properties of almost locally connected claw-free graphs.
Ars Comb.
Xiaodong Chen, Mingchu Li, Wei Liao, Hajo Broersma
2016 J jnl
On fan-wheel and tree-wheel Ramsey numbers.
Discret. Math.
Yanbo Zhang, Hajo Broersma, Yaojun Chen
2016 J jnl
On star-critical and upper size Ramsey numbers.
Discret. Appl. Math.
Yanbo Zhang, Hajo Broersma, Yaojun Chen
2016 J jnl
On the complexity of edge-colored subgraph partitioning problems in network optimization.
Discret. Math. Theor. Comput. Sci.
Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen
2015 J jnl
A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs.
Theor. Comput. Sci.
Limin Wang, Xiaoyan Zhang, Zhao Zhang, Hajo Broersma
2015 J jnl
Best Monotone Degree Conditions for Graph Properties: A Survey.
Graphs Comb.
Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro
2015 J jnl
Characterizing Heavy Subgraph Pairs for Pancyclicity.
Graphs Comb.
Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang
2015 J jnl
Closing the Gap on Path-Kipas Ramsey Numbers.
Electron. J. Comb.
Binlong Li, Yanbo Zhang, Halina Bielak, Hajo Broersma, Premek Holub
2015 — conf
Computational Matter: Evolving Computational Solutions in Materials.
GECCO (Companion)
Julian Francis Miller, Hajo Broersma
2015 J jnl
How tough is toughness?
Bull. EATCS
Hajo Broersma
2015 J jnl
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
J. Graph Theory
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2015 J jnl
On a directed tree problem motivated by a newly introduced graph product.
Electron. J. Graph Theory Appl.
Antoon Hendrik Boode, Hajo Broersma, Jan F. Broenink
2015 J jnl
Ramsey numbers of trees versus fans.
Discret. Math.
Yanbo Zhang, Hajo Broersma, Yaojun Chen
2015 J jnl
Three Results on Cycle-Wheel Ramsey Numbers.
Graphs Comb.
Yanbo Zhang, Hajo Broersma, Yaojun Chen
2014 J jnl
A remark on star-C4 and wheel-C4 Ramsey numbers.
Electron. J. Graph Theory Appl.
Yanbo Zhang, Hajo Broersma, Yaojun Chen
2014 J jnl
Heavy subgraph pairs for traceability of block-chains.
Discuss. Math. Graph Theory
Hajo Broersma, Binlong Li, Shenggui Zhang
2014 J jnl
On Toughness and Hamiltonicity of 2
J. Graph Theory
Hajo Broersma, Viresh Patel, Artem V. Pyatkin
2014 J jnl
Removable Edges and Chords of Longest Cycles in 3-Connected Graphs.
Graphs Comb.
Jichang Wu, Hajo Broersma, Haiyan Kang
2013 C conf
Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs.
MEMOCODE
Robert de Groote, Philip K. F. Hölzenspies, Jan Kuper, Hajo Broersma
2013 J jnl
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs.
Algorithmica
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
2013 J jnl
Forbidden subgraph pairs for traceability of block-chains.
Electron. J. Graph Theory Appl.
Binlong Li, Hajo Broersma, Shenggui Zhang
2013 J jnl
Fully decomposable split graphs.
Eur. J. Comb.
Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
2013 — conf
Improving the Performance of Periodic Real-time Processes: a Graph Theoretical Approach.
CPA
Antoon Hendrik Boode, Hajo Broersma, Jan F. Broenink
2013 J jnl
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
CoRR
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013 B conf
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.
WG
Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski
2013 J jnl
Three complexity results on coloring Pk-free graphs.
Eur. J. Comb.
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
2013 J jnl
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width.
Theor. Comput. Sci.
Hajo Broersma, Petr A. Golovach, Viresh Patel
2012 J jnl
Determining the chromatic number of triangle-free 2P
Theor. Comput. Sci.
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2012 — conf
Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs.
EUROMICRO-SEAA
Robert de Groote, Jan Kuper, Hajo Broersma, Gerard J. M. Smit
2012 J jnl
Nascence Project: Nanoscale Engineering for Novel Computation Using Evolution.
Int. J. Unconv. Comput.
Hajo Broersma, Faustino J. Gomez, Julian F. Miller, Mike Petty, Gunnar Tufte
2012 J jnl
Pairs of forbidden induced subgraphs for homogeneously traceable graphs.
Discret. Math.
Binlong Li, Hajo Broersma, Shenggui Zhang
2012 J jnl
The complexity of finding uniform sparsest cuts in various graph classes.
J. Discrete Algorithms
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
2012 J jnl
Updating the complexity status of coloring graphs without a fixed induced linear forest.
Theor. Comput. Sci.
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2011 J jnl
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs.
J. Graph Theory
Mingchu Li, Xiaodong Chen, Hajo Broersma
2011 B conf
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width.
IPEC
Hajo Broersma, Petr A. Golovach, Viresh Patel
2010 J jnl
Computing sharp 2-factors in claw-free graphs.
J. Discrete Algorithms
Hajo Broersma, Daniël Paulusma
2010 J jnl
Editorial.
J. Discrete Algorithms
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2010 B conf
Narrowing Down the Gap on the Complexity of Coloring
WG
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2010 — conf
On Coloring Graphs without Induced Forests.
ISAAC (2)
Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song
2010 C conf
The Complexity Status of Problems Related to Sparsest Cuts.
IWOCA
Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin
2009 J jnl
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number.
Discuss. Math. Graph Theory
Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman
2009 J jnl
Complexity of conditional colorability of graphs.
Appl. Math. Lett.
Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma
2009 J jnl
Editorial.
J. Discrete Algorithms
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2009 B conf
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.
WG
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
2009 C conf
Fully Decomposable Split Graphs.
IWOCA
Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
2009 J jnl
On hamiltonicity of
Math. Methods Oper. Res.
Hajo Broersma, Elkin Vumar
2009 J jnl
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.
Graphs Comb.
Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto
2009 C conf
Three Complexity Results on Coloring
IWOCA
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma
2009 J jnl
Upper bounds and algorithms for parallel knock-out numbers.
Theor. Comput. Sci.
Hajo Broersma, Matthew Johnson, Daniël Paulusma
2008 J jnl
A New Algorithm for On-line Coloring Bipartite Graphs.
SIAM J. Discret. Math.
Hajo Broersma, Agostino Capponi, Daniël Paulusma
2008 B conf
Computing Sharp 2-Factors in Claw-Free Graphs.
MFCS
Hajo Broersma, Daniël Paulusma
2008 J jnl
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks.
Discret. Math.
Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána
2008 B ed.
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers
WG
Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma
2008 J jnl
Preface.
J. Discrete Algorithms
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2008 J jnl
Some families of integral graphs.
Discret. Math.
Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still
2008 J jnl
The computational complexity of the parallel knock-out problem.
Theor. Comput. Sci.
Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
2007 J jnl
A new upper bound on the cyclic chromatic number.
J. Graph Theory
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel
2007 J jnl
Backbone colorings for graphs: Tree and path backbones.
J. Graph Theory
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
2007 J jnl
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.
Electron. Notes Discret. Math.
Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána
2007 J jnl
Eliminating graphs by means of parallel knock-out schemes.
Discret. Appl. Math.
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger
2007 — conf
Improved Upper Bounds for
SOFSEM (1)
Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman
2007 J jnl
Integral trees of diameter 6.
Discret. Appl. Math.
Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still
2007 J jnl
On Ramsey numbers for paths versus wheels.
Discret. Math.
A. N. M. Salman, Hajo Broersma
2007 J jnl
On components of 2-factors in claw-free graphs.
Electron. Notes Discret. Math.
Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto
2007 J jnl
On the complexity of dominating set problems related to the minimum all-ones problem.
Theor. Comput. Sci.
Hajo Broersma, Xueliang Li
2007 J jnl
Toughness and hamiltonicity in k-trees.
Discret. Math.
Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto
2007 J jnl
Tutte sets in graphs I: Maximal tutte sets and D-graphs.
J. Graph Theory
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
2007 J jnl
Tutte sets in graphs II: The complexity of finding maximum Tutte sets.
Discret. Appl. Math.
Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec
2007 B conf
Upper Bounds and Algorithms for Parallel Knock-Out Numbers.
SIROCCO
Hajo Broersma, Matthew Johnson, Daniël Paulusma
2006 — ed.
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK
ACiD
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
2006 J jnl
Global Connectivity And Expansion: Long Cycles and Factors In
Comb.
Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell
2006 C conf
On-Line Coloring of H-Free Bipartite Graphs.
CIAC
Hajo Broersma, Agostino Capponi, Daniël Paulusma
2006 J jnl
Path-fan Ramsey numbers.
Discret. Appl. Math.
A. N. M. Salman, Hajo Broersma
2006 J jnl
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.
Algorithmica
Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
2006 J jnl
Subpancyclicity of line graphs and degree sums along paths.
Discret. Appl. Math.
Liming Xiong, Hajo Broersma
2006 B conf
The Computational Complexity of the Parallel Knock-Out Problem.
LATIN
Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart
2006 J jnl
Toughness in Graphs - A Survey.
Graphs Comb.
Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
2005 — ed.
Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK
ACiD
Hajo Broersma, Matthew Johnson, Stefan Szeider
2005 J jnl
On stability of the hamiltonian index under contractions and closures.
J. Graph Theory
Liming Xiong, Zdenek Ryjácek, Hajo Broersma
2005 J jnl
Paths and cycles in colored graphs.
Australas. J Comb.
Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang
2004 B conf
Parallel Knock-Out Schemes in Networks.
MFCS
Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger
2004 J jnl
Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization.
Discret. Appl. Math.
Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann L. Hurink
2004 J jnl
Radio Labeling with Preassigned Frequencies.
SIAM J. Optim.
Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
2004 — conf
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture.
FPT
Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte
2004 B conf
The Computational Complexity of the Minimum Weight Processor Assignment Problem.
WG
Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger
2004 C conf
The Ramsey Numbers of Paths Versus Kipases.
CTW
A. N. M. Salman, Hajo Broersma
2004 J jnl
The hamiltonian index of a graph and its branch-bonds.
Discret. Math.
Liming Xiong, Hajo Broersma, Xueliang Li, Mingchu Li
2003 — conf
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems.
IJCCGGT
Hajo Broersma
2003 B conf
A graph covering algorithm for a coarse grain reconfigurable system.
LCTES
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters
2003 — conf
An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels.
IJCCGGT
Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma
2003 B conf
Backbone Colorings for Networks.
WG
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
2003 — conf
Mapping Applications to a Coarse Grain Reconfigurable System.
Asia-Pacific Computer Systems Architecture Conference
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Michèl A. J. Rosien, Paul M. Heysters
2003 J jnl
Preface: Volume 13.
Electron. Notes Discret. Math.
Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger
2003 J jnl
Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.
J. Autom. Lang. Comb.
A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro
2003 — conf
Template Generation and Selection Algorithms.
IWSOC
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters
2002 J jnl
A Fan Type Condition For Heavy Cycles in Weighted Graphs.
Graphs Comb.
Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang
2002 J jnl
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.
Algorithmica
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
2002 J jnl
A note on minimum degree conditions for supereulerian graphs.
Discret. Appl. Math.
Hajo Broersma, Liming Xiong
2002 J jnl
Degree sums and subpancyclicity in line graphs.
Discret. Math.
Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li
2002 J jnl
Forbidden subgraphs that imply hamiltonian-connectedness.
J. Graph Theory
Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman
2002 J jnl
Heavy cycles in weighted graphs.
Discuss. Math. Graph Theory
J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman
2002 J jnl
Isomorphisms and traversability of directed path graphs.
Discuss. Math. Graph Theory
Hajo Broersma, Xueliang Li
2002 J jnl
More About Subcolorings.
Computing
Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
2002 J jnl
More Progress on Tough Graphs - The Y2K Report.
Electron. Notes Discret. Math.
Douglas Bauer, Hajo Broersma, Edward F. Schmeichel
2002 B conf
More about Subcolorings.
WG
Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger
2002 J jnl
On some intriguing problems in hamiltonian graph theory--a survey.
Discret. Math.
Hajo Broersma
2002 — conf
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.
SWAT
Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger
2002 J jnl
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
Discret. Appl. Math.
Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
2002 A conf
Radio Labeling with Pre-assigned Frequencies.
ESA
Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
2002 J jnl
Some approaches to a conjecture on short cycles in digraphs.
Discret. Appl. Math.
Hajo Broersma, Xueliang Li
2001 J jnl
A
Discuss. Math. Graph Theory
Hajo Broersma, Xueliang Li, Shenggui Zhang
2001 J jnl
Paths and Cycles in Colored Graphs.
Electron. Notes Discret. Math.
Xueliang Li, Shenggui Zhang, Hajo Broersma
2001 J jnl
Preface: Volume 8.
Electron. Notes Discret. Math.
Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl
2001 J jnl
Strengthening the closure concept in claw-free graphs.
Discret. Math.
Hajo Broersma, Zdenek Ryjácek
2000 J jnl
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.
Discret. Appl. Math.
Hajo Broersma, Elias Dahlhaus, Ton Kloks
2000 J jnl
Closure Concepts: A Survey.
Graphs Comb.
Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer
2000 J jnl
Degree-preserving trees.
Networks
Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller
2000 J jnl
Heavy paths and cycles in weighted graphs.
Discret. Math.
Shenggui Zhang, Xueliang Li, Hajo Broersma
2000 J jnl
Not Every 2-tough Graph Is Hamiltonian.
Discret. Appl. Math.
Douglas Bauer, Hajo Broersma, Henk Jan Veldman
1999 J jnl
Another equivalent of the graceful tree conjecture.
Ars Comb.
Hajo Broersma, Cornelis Hoede
1999 J jnl
Independent Sets in Asteroidal Triple-Free Graphs.
SIAM J. Discret. Math.
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1999 J jnl
Various results on the toughness of graphs.
Networks
Hajo Broersma, Erik Engbers, Huib Trommel
1998 B conf
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.
WG
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1998 J jnl
Closure concepts for claw-free graphs.
Discret. Math.
Hajo Broersma, Huib Trommel
1998 B conf
Degree-Preserving Forests.
MFCS
Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
1998 J jnl
Independence trees and Hamilton cycles.
J. Graph Theory
Hajo Broersma, Hilde Tuinstra
1997 B conf
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.
WG
Hajo Broersma, Elias Dahlhaus, Ton Kloks
1997 J jnl
Cycles through subsets with large degree sums.
Discret. Math.
Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman
1997 A* conf
Independent Sets in Asteroidal Triple-Free Graphs.
ICALP
Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller
1997 J jnl
Spanning trees with many or few colors in edge-colored graphs.
Discuss. Math. Graph Theory
Hajo Broersma, Xueliang Li
1997 J jnl
Spanning trees with pairwise nonadjacent endvertices.
Discret. Math.
Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
1996 J jnl
The connectivity of the leaf-exchange spanning tree graph of a graph.
Ars Comb.
Hajo Broersma, Xueliang Li
1994 J jnl
Subgraphs, Closures and Hamiltonicity.
Discret. Appl. Math.
Hajo Broersma, Ingo Schiermeyer
1993 J jnl
On "The Matching Polynomial of a Polygraph".
Discret. Appl. Math.
Hajo Broersma, Xueliang Li
1989 J jnl
A generalization of a result of Häggkvist and Nicoghossian.
J. Comb. Theory B
Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao