Hajo Broersma

According to our database, Hajo Broersma authored at least 197 papers between 1987 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs.

Fangfang Wu, Hajo Broersma, Shenggui Zhang, Binlong Li

J. Graph Theory, January, 2024

Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number.

Xiuwen Yang, Hajo Broersma, Ligong Wang

Discret. Math., January, 2024

2023

Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs.

Tingting Han, Hajo Broersma, Yandong Bai, Shenggui Zhang

Discret. Appl. Math., 2023

Online Graph Coloring with Predictions.

Antonios Antoniadis, Hajo Broersma, Yang Meng

CoRR, 2023

Polynomial algorithms for computing the isolated toughness of interval and split graphs.

Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang

Concurr. Comput. Pract. Exp., 2023

The effect of graph operations on the degree-based entropy.

Yanni Dong, Hajo Broersma, Changwu Song, Pengfei Wan, Shenggui Zhang

Appl. Math. Comput., 2023

2022

The Erdős-Gyárfás function with respect to Gallai-colorings.

Xihe Li, Hajo Broersma, Ligong Wang

J. Graph Theory, 2022

Toughness, forbidden subgraphs, and Hamiltonian-connected graphs.

Wei Zheng, Hajo Broersma, Ligong Wang

Discuss. Math. Graph Theory, 2022

On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees.

Xiangxiang Liu, Hajo Broersma, Ligong Wang

Discret. Math., 2022

The Hamiltonian properties in <i>K</i>_{1, <i>r</i>}-free split graphs.

Guowei Dai, Zan-Bo Zhang, Hajo Broersma, Xiaoyan Zhang

Discret. Math., 2022

Integer Colorings with No Rainbow 3-Term Arithmetic Progression.

Xihe Li, Hajo Broersma, Ligong Wang

Electron. J. Comb., 2022

Some New Bounds for the Inverse Sum Indeg Energy of Graphs.

Fengwei Li, Qingfang Ye, Hajo Broersma

Axioms, 2022

2021

Dopant network processing units: towards efficient neural network emulators with high-capacity nanoelectronic nodes.

Hans-Christian Ruiz Euler, Unai Alegre Ibarra, Bram van de Ven, Hajo Broersma, Peter A. Bobbert, Wilfred G. van der Wiel

Neuromorph. Comput. Eng., 2021

Edge-colored complete graphs without properly colored even cycles: A full characterization.

Ruonan Li, Hajo Broersma, Maho Yokota, Kiyoshi Yoshimoto

J. Graph Theory, 2021

Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs.

Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu

Graphs Comb., 2021

Toughness, Forbidden Subgraphs and Pancyclicity.

Wei Zheng, Hajo Broersma, Ligong Wang

Graphs Comb., 2021

On hamiltonicity of 1-tough triangle-free graphs.

Wei Zheng, Hajo Broersma, Ligong Wang

Electron. J. Graph Theory Appl., 2021

Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph.

Hajo Broersma, Qin Ma, Yaping Mao, Jichang Wu

Discuss. Math. Graph Theory, 2021

Extremal problems and results related to Gallai-colorings.

Xihe Li, Hajo Broersma, Ligong Wang

Discret. Math., 2021

Almost eulerian compatible spanning circuits in edge-colored graphs.

Zhiwei Guo, Hajo Broersma, Binlong Li, Shenggui Zhang

Discret. Math., 2021

On sufficient spectral radius conditions for hamiltonicity.

Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu

Discret. Appl. Math., 2021

On the Spectra of General Random Mixed Graphs.

Dan Hu, Hajo Broersma, Jiangyou Hou, Shenggui Zhang

Electron. J. Comb., 2021

Extremality of VDB topological indices over f-benzenoids with given order.

Fengwei Li, Qingfang Ye, Hajo Broersma, Ruixuan Ye, Xiao-Yan Zhang

Appl. Math. Comput., 2021

2020

Classification with a disordered dopant-atom network in silicon.

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

Nat., 2020

Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs.

Ruonan Li, Hajo Broersma, Shenggui Zhang

J. Graph Theory, 2020

Some algorithmic results for finding compatible spanning circuits in edge-colored graphs.

Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang

J. Comb. Optim., 2020

Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs.

Wei Zheng, Hajo Broersma, Ligong Wang, Shenggui Zhang

Discret. Math., 2020

On sufficient degree conditions for traceability of claw-free graphs.

Tao Tian, Hajo Broersma, Liming Xiong

Discret. Math., 2020

Optimal Algorithm of Isolated Toughness for Interval Graphs.

Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang

Proceedings of the Parallel and Distributed Computing, Applications and Technologies, 2020

2019

Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs.

Ruonan Li, Hajo Broersma, Shenggui Zhang

Graphs Comb., 2019

A polynomial algorithm for weighted scattering number in interval graphs.

Fengwei Li, Xiaoyan Zhang, Hajo Broersma

Discret. Appl. Math., 2019

Decompositions of graphs based on a new graph product.

Antoon Hendrik Boode, Hajo Broersma

Discret. Appl. Math., 2019

2018

Philosophy of Computation.

Zoran Konkoli, Susan Stepney, Hajo Broersma, Paolo Dini, Chrystopher L. Nehaniv, Stefano Nichele

Proceedings of the Computational Matter, 2018

Computability and Complexity of Unconventional Computing Devices.

Hajo Broersma, Susan Stepney, Göran Wendin

Proceedings of the Computational Matter, 2018

Conditions for graphs to be path partition optimal.

Binlong Li, Hajo Broersma, Shenggui Zhang

Discret. Math., 2018

Extremal benzenoid systems for two modified versions of the Randić index.

Fengwei Li, Hajo Broersma, Juan Rada, Yuefang Sun

Appl. Math. Comput., 2018

2017

Extremal and Degree Conditions for Path Extendability in Digraphs.

Zan-Bo Zhang, Xiaoyan Zhang, Hajo Broersma, Dingjun Lou

SIAM J. Discret. Math., 2017

An Exact Formula for all Star-Kipas Ramsey Numbers.

Binlong Li, Yanbo Zhang, Hajo Broersma

Graphs Comb., 2017

Cycle extension in edge-colored complete graphs.

Ruonan Li, Hajo Broersma, Chuandong Xu, Shenggui Zhang

Discret. Math., 2017

Computability and Complexity of Unconventional Computing Devices.

Hajo Broersma, Susan Stepney, Göran Wendin

CoRR, 2017

2016

On the complexity of edge-colored subgraph partitioning problems in network optimization.

Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen

Discret. Math. Theor. Comput. Sci., 2016

Forbidden subgraphs for hamiltonicity of 1-tough graphs.

Hajo Broersma, Binlong Li, Shenggui Zhang

Discuss. Math. Graph Theory, 2016

On fan-wheel and tree-wheel Ramsey numbers.

Yanbo Zhang, Hajo Broersma, Yaojun Chen

Discret. Math., 2016

On star-critical and upper size Ramsey numbers.

Yanbo Zhang, Hajo Broersma, Yaojun Chen

Discret. Appl. Math., 2016

Hamiltonian properties of almost locally connected claw-free graphs.

Xiaodong Chen, Mingchu Li, Wei Liao, Hajo Broersma

Ars Comb., 2016

A simulation tool for evolving functionalities in disordered nanoparticle networks.

Ruud van Damme, Hajo Broersma, Julia Mikhal, Celestine Lawrence, Wilfred G. van der Wiel

Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2015

A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs.

Limin Wang, Xiaoyan Zhang, Zhao Zhang, Hajo Broersma

Theor. Comput. Sci., 2015

Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs.

Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski

J. Graph Theory, 2015

Three Results on Cycle-Wheel Ramsey Numbers.

Yanbo Zhang, Hajo Broersma, Yaojun Chen

Graphs Comb., 2015

Characterizing Heavy Subgraph Pairs for Pancyclicity.

Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang

Graphs Comb., 2015

Best Monotone Degree Conditions for Graph Properties: A Survey.

Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro

Graphs Comb., 2015

On a directed tree problem motivated by a newly introduced graph product.

Antoon Hendrik Boode, Hajo Broersma, Jan F. Broenink

Electron. J. Graph Theory Appl., 2015

How tough is toughness?

Hajo Broersma

Bull. EATCS, 2015

Ramsey numbers of trees versus fans.

Yanbo Zhang, Hajo Broersma, Yaojun Chen

Discret. Math., 2015

Closing the Gap on Path-Kipas Ramsey Numbers.

Binlong Li, Yanbo Zhang, Halina Bielak, Hajo Broersma, Premek Holub

Electron. J. Comb., 2015

Computational Matter: Evolving Computational Solutions in Materials.

Julian Francis Miller, Hajo Broersma

Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014

On Toughness and Hamiltonicity of 2<i>K</i>₂-Free Graphs.

Hajo Broersma, Viresh Patel, Artem V. Pyatkin

J. Graph Theory, 2014

Removable Edges and Chords of Longest Cycles in 3-Connected Graphs.

Jichang Wu, Hajo Broersma, Haiyan Kang

Graphs Comb., 2014

A remark on star-C4 and wheel-C4 Ramsey numbers.

Yanbo Zhang, Hajo Broersma, Yaojun Chen

Electron. J. Graph Theory Appl., 2014

Heavy subgraph pairs for traceability of block-chains.

Hajo Broersma, Binlong Li, Shenggui Zhang

Discuss. Math. Graph Theory, 2014

2013

Tight complexity bounds for FPT subgraph problems parameterized by the clique-width.

Hajo Broersma, Petr A. Golovach, Viresh Patel

Theor. Comput. Sci., 2013

Toughness and Vertex Degrees.

Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel

J. Graph Theory, 2013

Tank-Ring Factors in Supereulerian Claw-Free Graphs.

Mingchu Li, Lifeng Yuan, He Jiang, Bing Liu, Haitze J. Broersma

Graphs Comb., 2013

Forbidden subgraph pairs for traceability of block-chains.

Binlong Li, Hajo Broersma, Shenggui Zhang

Electron. J. Graph Theory Appl., 2013

Fully decomposable split graphs.

Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger

Eur. J. Comb., 2013

Three complexity results on coloring Pk-free graphs.

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma

Eur. J. Comb., 2013

Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs.

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma

Algorithmica, 2013

Improving the Performance of Periodic Real-time Processes: a Graph Theoretical Approach.

Antoon Hendrik Boode, Hajo Broersma, Jan F. Broenink

Proceedings of the 35th Communicating Process Architectures, 2013

Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs.

Robert de Groote, Philip K. F. Hölzenspies, Jan Kuper, Hajo Broersma

Proceedings of the 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, 2013

2012

Determining the chromatic number of triangle-free 2P₃-free graphs in polynomial time.

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Theor. Comput. Sci., 2012

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

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Theor. Comput. Sci., 2012

The complexity of finding uniform sparsest cuts in various graph classes.

Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin

J. Discrete Algorithms, 2012

Nascence Project: Nanoscale Engineering for Novel Computation Using Evolution.

Hajo Broersma, Faustino J. Gomez, Julian F. Miller, Mike Petty, Gunnar Tufte

Int. J. Unconv. Comput., 2012

How Many Conjectures Can You Stand? A Survey.

Haitze J. Broersma, Zdenek Ryjácek, Petr Vrána

Graphs Comb., 2012

Degree Sequences and the Existence of k-Factors.

Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel

Graphs Comb., 2012

Pairs of forbidden induced subgraphs for homogeneously traceable graphs.

Binlong Li, Hajo Broersma, Shenggui Zhang

Discret. Math., 2012

Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs.

Robert de Groote, Jan Kuper, Hajo Broersma, Gerard J. M. Smit

Proceedings of the 38th Euromicro Conference on Software Engineering and Advanced Applications, 2012

2011

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

Mingchu Li, Xiaodong Chen, Hajo Broersma

J. Graph Theory, 2011

2010

Computing sharp 2-factors in claw-free graphs.

Hajo Broersma, Daniël Paulusma

J. Discrete Algorithms, 2010

Narrowing Down the Gap on the Complexity of Coloring <i>P</i>_<i>k</i>-Free Graphs.

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

The Complexity Status of Problems Related to Sparsest Cuts.

Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

On Coloring Graphs without Induced Forests.

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Upper bounds and algorithms for parallel knock-out numbers.

Hajo Broersma, Matthew Johnson, Daniël Paulusma

Theor. Comput. Sci., 2009

On hamiltonicity of <i>P</i> ₃-dominated graphs.

Hajo Broersma, Elkin Vumar

Math. Methods Oper. Res., 2009

Editorial.

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider

J. Discrete Algorithms, 2009

Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs.

Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto

Graphs Comb., 2009

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

Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman

Discuss. Math. Graph Theory, 2009

lambda-backbone colorings along pairwise disjoint stars and matchings.

Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto

Discret. Math., 2009

Complexity of conditional colorability of graphs.

Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma

Appl. Math. Lett., 2009

Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2009

Three Complexity Results on Coloring <i>P</i>_<i>k</i>-Free Graphs.

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

The computational complexity of the parallel knock-out problem.

Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart

Theor. Comput. Sci., 2008

A New Algorithm for On-line Coloring Bipartite Graphs.

Hajo Broersma, Agostino Capponi, Daniël Paulusma

SIAM J. Discret. Math., 2008

Preface.

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider

J. Discrete Algorithms, 2008

Some families of integral graphs.

Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still

Discret. Math., 2008

Connected even factors in claw-free graphs.

Mingchu Li, Liming Xiong, Haitze J. Broersma

Discret. Math., 2008

2007

On the complexity of dominating set problems related to the minimum all-ones problem.

Hajo Broersma, Xueliang Li

Theor. Comput. Sci., 2007

Backbone colorings for graphs: Tree and path backbones.

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger

J. Graph Theory, 2007

A new upper bound on the cyclic chromatic number.

Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel

J. Graph Theory, 2007

Tutte sets in graphs I: Maximal tutte sets and D-graphs.

Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel

J. Graph Theory, 2007

On components of 2-factors in claw-free graphs.

Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto

Electron. Notes Discret. Math., 2007

Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks.

Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána

Electron. Notes Discret. Math., 2007

On Ramsey numbers for paths versus wheels.

A. N. M. Salman, Hajo Broersma

Discret. Math., 2007

Toughness and hamiltonicity in k-trees.

Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto

Discret. Math., 2007

Integral trees of diameter 6.

Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still

Discret. Appl. Math., 2007

Path-kipas Ramsey numbers.

A. N. M. Salman, Haitze J. Broersma

Discret. Appl. Math., 2007

Eliminating graphs by means of parallel knock-out schemes.

Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger

Discret. Appl. Math., 2007

Tutte sets in graphs II: The complexity of finding maximum Tutte sets.

Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec

Discret. Appl. Math., 2007

Improved Upper Bounds for <i>lambda</i> -Backbone Colorings Along Matchings and Stars.

Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Toughness in Graphs - A Survey.

Douglas Bauer, Hajo Broersma, Edward F. Schmeichel

Graphs Comb., 2006

Subpancyclicity of line graphs and degree sums along paths.

Liming Xiong, Hajo Broersma

Discret. Appl. Math., 2006

Path-fan Ramsey numbers.

A. N. M. Salman, Hajo Broersma

Discret. Appl. Math., 2006

Global Connectivity And Expansion: Long Cycles and Factors In <i>f</i>-Connected Graphs.

Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell

Comb., 2006

Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult.

Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger

Algorithmica, 2006

On-Line Coloring of H-Free Bipartite Graphs.

Hajo Broersma, Agostino Capponi, Daniël Paulusma

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

On stability of the hamiltonian index under contractions and closures.

Liming Xiong, Zdenek Ryjácek, Hajo Broersma

J. Graph Theory, 2005

Paths and cycles in colored graphs.

Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang

Australas. J Comb., 2005

2004

Radio Labeling with Preassigned Frequencies.

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger

SIAM J. Optim., 2004

The Ramsey Numbers of Paths Versus Kipases.

A. N. M. Salman, Haitze J. Broersma

Electron. Notes Discret. Math., 2004

The hamiltonian index of a graph and its branch-bonds.

Liming Xiong, Hajo Broersma, Xueliang Li, Mingchu Li

Discret. Math., 2004

Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization.

Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann L. Hurink

Discret. Appl. Math., 2004

The Computational Complexity of the Minimum Weight Processor Assignment Problem.

Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2004

Parallel Knock-Out Schemes in Networks.

Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture.

Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte

Proceedings of the 2004 IEEE International Conference on Field-Programmable Technology, 2004

2003

Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.

A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro

J. Autom. Lang. Comb., 2003

The Ramsey Numbers of Paths Versus Fans.

A. N. M. Salman, Haitze J. Broersma

Electron. Notes Discret. Math., 2003

Preface: Volume 13.

Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger

Electron. Notes Discret. Math., 2003

Backbone Colorings for Networks.

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

A graph covering algorithm for a coarse grain reconfigurable system.

Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters

Proceedings of the 2003 Conference on Languages, 2003

An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels.

Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

A General Framework for Coloring Problems: Old Results, New Results, and Open Problems.

Hajo Broersma

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

Template Generation and Selection Algorithms.

Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters

Proceedings of the 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications (IWSOC'03), 30 June, 2003

Mapping Applications to a Coarse Grain Reconfigurable System.

Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Michèl A. J. Rosien, Paul M. Heysters

Proceedings of the Advances in Computer Systems Architecture, 2003

2002

Forbidden subgraphs that imply hamiltonian-connectedness.

Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman

J. Graph Theory, 2002

A Fan Type Condition For Heavy Cycles in Weighted Graphs.

Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang

Graphs Comb., 2002

More Progress on Tough Graphs - The Y2K Report.

Douglas Bauer, Hajo Broersma, Edward F. Schmeichel

Electron. Notes Discret. Math., 2002

Isomorphisms and traversability of directed path graphs.

Hajo Broersma, Xueliang Li

Discuss. Math. Graph Theory, 2002

Heavy cycles in weighted graphs.

J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman

Discuss. Math. Graph Theory, 2002

Degree sums and subpancyclicity in line graphs.

Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li

Discret. Math., 2002

On some intriguing problems in hamiltonian graph theory--a survey.

Hajo Broersma

Discret. Math., 2002

A note on minimum degree conditions for supereulerian graphs.

Hajo Broersma, Liming Xiong

Discret. Appl. Math., 2002

Some approaches to a conjecture on short cycles in digraphs.

Hajo Broersma, Xueliang Li

Discret. Appl. Math., 2002

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.

Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel

Discret. Appl. Math., 2002

More About Subcolorings.

Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger

Computing, 2002

A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems.

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller

Algorithmica, 2002

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger

Proceedings of the Algorithm Theory, 2002

Radio Labeling with Pre-assigned Frequencies.

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger

Proceedings of the Algorithms, 2002

2001

On factors of 4-connected claw-free graphs.

Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek

J. Graph Theory, 2001

Paths and Cycles in Colored Graphs.

Xueliang Li, Shenggui Zhang, Hajo Broersma

Electron. Notes Discret. Math., 2001

Preface: Volume 8.

Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl

Electron. Notes Discret. Math., 2001

A <i>σ₃</i> type condition for heavy cycles in weighted graphs.

Hajo Broersma, Xueliang Li, Shenggui Zhang

Discuss. Math. Graph Theory, 2001

Strengthening the closure concept in claw-free graphs.

Hajo Broersma, Zdenek Ryjácek

Discret. Math., 2001

2000

Degree-preserving trees.

Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller

Networks, 2000

Closure Concepts: A Survey.

Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer

Graphs Comb., 2000

Heavy paths and cycles in weighted graphs.

Shenggui Zhang, Xueliang Li, Hajo Broersma

Discret. Math., 2000

A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.

Hajo Broersma, Elias Dahlhaus, Ton Kloks

Discret. Appl. Math., 2000

Not Every 2-tough Graph Is Hamiltonian.

Douglas Bauer, Hajo Broersma, Henk Jan Veldman

Discret. Appl. Math., 2000

1999

Independent Sets in Asteroidal Triple-Free Graphs.

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller

SIAM J. Discret. Math., 1999

Various results on the toughness of graphs.

Hajo Broersma, Erik Engbers, Huib Trommel

Networks, 1999

Another equivalent of the graceful tree conjecture.

Hajo Broersma, Cornelis Hoede

Ars Comb., 1999

1998

Independence trees and Hamilton cycles.

Hajo Broersma, Hilde Tuinstra

J. Graph Theory, 1998

Closure concepts for claw-free graphs.

Hajo Broersma, Huib Trommel

Discret. Math., 1998

A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking.

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Degree-Preserving Forests.

Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Spanning trees with many or few colors in edge-colored graphs.

Hajo Broersma, Xueliang Li

Discuss. Math. Graph Theory, 1997

Dirac's minimum degree condition restricted to claws.

Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer

Discret. Math., 1997

Cycles through subsets with large degree sums.

Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman

Discret. Math., 1997

A note on the minimum size of a vertex pancyclic graph.

Haitze J. Broersma

Discret. Math., 1997

Spanning trees with pairwise nonadjacent endvertices.

Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz

Discret. Math., 1997

Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs.

Hajo Broersma, Elias Dahlhaus, Ton Kloks

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1997

1996

Toughness and hamiltonicity in almost claw-free graphs.

Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer

J. Graph Theory, 1996

Hamiltonicity of regular 2-connected graphs.

Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman

J. Graph Theory, 1996

Toughness and longest cycles in 2-connected planar graphs.

Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman

J. Graph Theory, 1996

On graphs satisfying a local ore-type condition.

Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

J. Graph Theory, 1996

The connectivity of the leaf-exchange spanning tree graph of a graph.

Hajo Broersma, Xueliang Li

Ars Comb., 1996

1995

Bipartite regular graphs with fixed diameter.

Haitze J. Broersma, F. Göbel

Networks, 1995

Cycles through particular subgraphs of claw-free graphs.

Haitze J. Broersma, M. Lu

J. Graph Theory, 1995

Long cycles in graphs with prescribed toughness and minimum degree.

Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

Discret. Math., 1995

On generalizing a theorem of Jung.

Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman

Ars Comb., 1995

1994

A closure concept based on neighborhood unions of independent triples.

Haitze J. Broersma, Ingo Schiermeyer

Discret. Math., 1994

Subgraphs, Closures and Hamiltonicity.

Hajo Broersma, Ingo Schiermeyer

Discret. Appl. Math., 1994

1993

Decomposition of bipartite graphs under degree constraints.

Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman

Networks, 1993

Cycles containing all vertices of maximum degree.

Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman

J. Graph Theory, 1993

Generating all 3-connected 4-regular planar graphs from the octahedron graph.

Haitze J. Broersma, A. J. W. Duijvestijn, F. Göbel

J. Graph Theory, 1993

Long paths and cycles in tough graphs.

Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman

Graphs Comb., 1993

A generalization of Ore's Theorem involving neighborhood unions.

Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

Discret. Math., 1993

Long cycles, degree sums and neighborhood unions.

Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman

Discret. Math., 1993

Coloring a graph optimally with two colors.

Haitze J. Broersma, F. Göbel

Discret. Math., 1993

A note on K₄-closures in hamiltonian graph theory.

Haitze J. Broersma

Discret. Math., 1993

On "The Matching Polynomial of a Polygraph".

Hajo Broersma, Xueliang Li

Discret. Appl. Math., 1993

1992

An Affirmative Action Graph (D. J. Newman).

Haitze J. Broersma, Andy Liu, L. V. Saxton

SIAM Rev., 1992

The connectivity of the basis graph of a branching greedoid.

Haitze J. Broersma, Xueliang Li

J. Graph Theory, 1992

1991

Long dominating cycles and paths in graphs with large neighborhood unions.

Haitze J. Broersma, Henk Jan Veldman

J. Graph Theory, 1991

1989

Path graphs.

Haitze J. Broersma, Cornelis Hoede

J. Graph Theory, 1989

A generalization of a result of Häggkvist and Nicoghossian.

Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao

J. Comb. Theory, Ser. B, 1989

1988

Existence of Δ_λ-cycles and Δ_λ-paths.

Haitze J. Broersma

J. Graph Theory, 1988

1987

3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian.

Haitze J. Broersma, Henk Jan Veldman

J. Graph Theory, 1987