Hajo Broersma

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): 129-145 (2013)

Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger: Fully decomposable split graphs. Eur. J. Comb. 34(3): 567-575 (2013)

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34(3): 609-619 (2013)

MingChu Li, Lifeng Yuan, He Jiang, Bing Liu, H. J. Broersma: Tank-Ring Factors in Supereulerian Claw-Free Graphs. Graphs and Combinatorics 29(3): 599-608 (2013)

Douglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel: Toughness and Vertex Degrees. Journal of Graph Theory 72(2): 209-219 (2013)

Hajo Broersma, Petr A. Golovach, Viresh Patel: Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485: 69-84 (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 abs/1301.5953 (2013)

Binlong Li, Hajo Broersma, Shenggui Zhang: Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discrete Mathematics 312(18): 2800-2818 (2012)

H. J. Broersma, Zdenek Ryjácek, Petr Vrána: How Many Conjectures Can You Stand? A Survey. Graphs and Combinatorics 28(1): 57-75 (2012)

Douglas Bauer, H. J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel: Degree Sequences and the Existence of k-Factors. Graphs and Combinatorics 28(2): 149-166 (2012)

Hajo Broersma, Faustino Gomez, Julian F. Miller, Mike Petty, Gunnar Tufte: Nascence Project: Nanoscale Engineering for Novel Computation Using Evolution. IJUC 8(4): 313-317 (2012)

Paul Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin: The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14: 136-149 (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): 9-19 (2012)

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Determining the chromatic number of triangle-free 2P₃-free graphs in polynomial time. Theor. Comput. Sci. 423: 1-10 (2012)

Robert de Groote, Jan Kuper, Hajo Broersma, Gerard J. M. Smit: Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs. EUROMICRO-SEAA 2012: 29-38

MingChu Li, Xiaodong Chen, Hajo Broersma: Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Journal of Graph Theory 68(4): 285-298 (2011)

Hajo Broersma, Petr A. Golovach, Viresh Patel: Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC 2011: 207-218

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 8(2): 101 (2010)

Hajo Broersma, Daniël Paulusma: Computing sharp 2-factors in claw-free graphs. J. Discrete Algorithms 8(3): 321-329 (2010)

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167

Paul Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin: The Complexity Status of Problems Related to Sparsest Cuts. IWOCA 2010: 125-135

Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song: Narrowing Down the Gap on the Complexity of Coloring P_k-Free Graphs. WG 2010: 63-74

Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma: Complexity of conditional colorability of graphs. Appl. Math. Lett. 22(3): 320-324 (2009)

H. J. Broersma, Jun Fujisawa, L. Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto: lambda-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics 309(18): 5596-5609 (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. Discussiones Mathematicae Graph Theory 29(1): 143-162 (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 and Combinatorics 25(4): 427-460 (2009)

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Editorial. J. Discrete Algorithms 7(2): 147 (2009)

Hajo Broersma, Elkin Vumar: On hamiltonicity of P ₃-dominated graphs. Math. Meth. of OR 69(2): 297-306 (2009)

Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009)

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma: Three Complexity Results on Coloring P_k-Free Graphs. IWOCA 2009: 95-104

Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger: Fully Decomposable Split Graphs. IWOCA 2009: 105-112

Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma: Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53

MingChu Li, Liming Xiong, H. J. Broersma: Connected even factors in claw-free graphs. Discrete Mathematics 308(11): 2282-2284 (2008)

Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána: Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discrete Mathematics 308(24): 6064-6077 (2008)

Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Some families of integral graphs. Discrete Mathematics 308(24): 6383-6391 (2008)

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider: Preface. J. Discrete Algorithms 6(4): 539 (2008)

Hajo Broersma, Agostino Capponi, Daniël Paulusma: A New Algorithm for On-line Coloring Bipartite Graphs. SIAM J. Discrete Math. 22(1): 72-91 (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): 182-195 (2008)

Hajo Broersma, Daniël Paulusma: Computing Sharp 2-Factors in Claw-Free Graphs. MFCS 2008: 193-204

Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma (Eds.): Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Lecture Notes in Computer Science 5344, 2008, isbn 978-3-540-92247-6

Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger: Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics 155(2): 92-102 (2007)

Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still: Integral trees of diameter 6. Discrete Applied Mathematics 155(10): 1254-1266 (2007)

Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, T. Surowiec: Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discrete Applied Mathematics 155(10): 1336-1343 (2007)

A. N. M. Salman, H. J. Broersma: Path-kipas Ramsey numbers. Discrete Applied Mathematics 155(14): 1878-1884 (2007)

Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto: Toughness and hamiltonicity in k-trees. Discrete Mathematics 307(7-8): 832-838 (2007)

A. N. M. Salman, Hajo Broersma: On Ramsey numbers for paths versus wheels. Discrete Mathematics 307(7-8): 975-982 (2007)

Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána: Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electronic Notes in Discrete Mathematics 28: 55-59 (2007)

Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto: On components of 2-factors in claw-free graphs. Electronic Notes in Discrete Mathematics 29: 289-293 (2007)

Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel: A new upper bound on the cyclic chromatic number. Journal of Graph Theory 54(1): 58-72 (2007)

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory 55(2): 137-152 (2007)

Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel: Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory 55(4): 343-358 (2007)

Hajo Broersma, Xueliang Li: On the complexity of dominating set problems related to the minimum all-ones problem. Theor. Comput. Sci. 385(1-3): 60-70 (2007)

Hajo Broersma, Matthew Johnson, Daniël Paulusma: Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340

Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman: Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. SOFSEM (1) 2007: 188-199

Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006)

Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell: Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Combinatorica 26(1): 17-36 (2006)

A. N. M. Salman, Hajo Broersma: Path-fan Ramsey numbers. Discrete Applied Mathematics 154(9): 1429-1436 (2006)

Liming Xiong, Hajo Broersma: Subpancyclicity of line graphs and degree sums along paths. Discrete Applied Mathematics 154(9): 1453-1463 (2006)

Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: Toughness in Graphs - A Survey. Graphs and Combinatorics 22(1): 1-35 (2006)

Hajo Broersma, Agostino Capponi, Daniël Paulusma: On-Line Coloring of H-Free Bipartite Graphs. CIAC 2006: 284-295

Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart: The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261

Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider (Eds.): Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Texts in Algorithmics 7, King's College, London 2006, isbn 1-904987-38-9

Liming Xiong, Zdenek Ryjácek, Hajo Broersma: On stability of the hamiltonian index under contractions and closures. Journal of Graph Theory 49(2): 104-115 (2005)

Hajo Broersma, Matthew Johnson, Stefan Szeider (Eds.): Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK. Texts in Algorithmics 4, King's College, London 2005, isbn 1-904987-10-9

Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann Hurink: Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Discrete Applied Mathematics 136(2-3): 159-160 (2004)

Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li: The hamiltonian index of a graph and its branch-bonds. Discrete Mathematics 285(1-3): 279-288 (2004)

A. N. M. Salman, H. J. Broersma: The Ramsey Numbers of Paths Versus Kipases. Electronic Notes in Discrete Mathematics 17: 251-255 (2004)

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Preassigned Frequencies. SIAM Journal on Optimization 15(1): 1-16 (2004)

A. N. M. Salman, Hajo Broersma: The Ramsey Numbers of Paths Versus Kipases. CTW 2004: 218-222

Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte: Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. FPT 2004: 421-424

Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger: Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214

Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger: The Computational Complexity of the Minimum Weight Processor Assignment Problem. WG 2004: 189-200

A. N. M. Salman, H. J. Broersma: The Ramsey Numbers of Paths Versus Fans. Electronic Notes in Discrete Mathematics 13: 103-107 (2003)

Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl, Gerhard J. Woeginger: Preface: Volume 13. Electronic Notes in Discrete Mathematics 13: 128 (2003)

A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro: Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs. Journal of Automata, Languages and Combinatorics 8(4): 675-681 (2003)

Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Michèl A. J. Rosien, Paul M. Heysters: Mapping Applications to a Coarse Grain Reconfigurable System. Asia-Pacific Computer Systems Architecture Conference 2003: 221-235

Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters: Template Generation and Selection Algorithms. IWSOC 2003: 2-6

Hajo Broersma: A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. IJCCGGT 2003: 65-79

Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma: An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. IJCCGGT 2003: 181-184

Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters: A graph covering algorithm for a coarse grain reconfigurable system. LCTES 2003: 199-208

Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger: Backbone Colorings for Networks. WG 2003: 131-142

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica 32(4): 594-610 (2002)

Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More About Subcolorings. Computing 69(3): 187-203 (2002)

Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel: Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics 120(1-3): 13-23 (2002)

Hajo Broersma, Liming Xiong: A note on minimum degree conditions for supereulerian graphs. Discrete Applied Mathematics 120(1-3): 35-43 (2002)

Hajo Broersma, Xueliang Li: Some approaches to a conjecture on short cycles in digraphs. Discrete Applied Mathematics 120(1-3): 45-53 (2002)

Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li: Degree sums and subpancyclicity in line graphs. Discrete Mathematics 242(1-3): 255-267 (2002)

Hajo Broersma: On some intriguing problems in hamiltonian graph theory--a survey. Discrete Mathematics 251(1-3): 47-69 (2002)

John Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman: Heavy cycles in weighted graphs. Discussiones Mathematicae Graph Theory 22(1): 7-15 (2002)

Hajo Broersma, Xueliang Li: Isomorphisms and traversability of directed path graphs. Discussiones Mathematicae Graph Theory 22(2): 215-228 (2002)

Douglas Bauer, Hajo Broersma, Edward F. Schmeichel: More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics 11: 63-80 (2002)

Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang: A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs and Combinatorics 18(1): 193-200 (2002)

Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman: Forbidden subgraphs that imply hamiltonian-connectedness. Journal of Graph Theory 40(2): 104-119 (2002)

Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222

Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger: Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT 2002: 160-169

Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger: More about Subcolorings. WG 2002: 68-79

Hajo Broersma, Zdenek Ryjácek: Strengthening the closure concept in claw-free graphs. Discrete Mathematics 233(1-3): 55-63 (2001)

Hajo Broersma, Xueliang Li, Shenggui Zhang: A σ₃ type condition for heavy cycles in weighted graphs. Discussiones Mathematicae Graph Theory 21(2): 159-166 (2001)

Hajo Broersma, Ulrich Faigle, Johann Hurink, Stefan Pickl: Preface: Volume 8. Electronic Notes in Discrete Mathematics 8: 1 (2001)

Xueliang Li, Shenggui Zhang, Hajo Broersma: Paths and Cycles in Colored Graphs. Electronic Notes in Discrete Mathematics 8: 128-132 (2001)

H. J. Broersma, Matthias Kriesell, Zdenek Ryjácek: On factors of 4-connected claw-free graphs. Journal of Graph Theory 37(2): 125-136 (2001)

Douglas Bauer, Hajo Broersma, Henk Jan Veldman: Not Every 2-tough Graph Is Hamiltonian. Discrete Applied Mathematics 99(1-3): 317-321 (2000)

Hajo Broersma, Elias Dahlhaus, Ton Kloks: A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discrete Applied Mathematics 99(1-3): 367-400 (2000)

Shenggui Zhang, Xueliang Li, Hajo Broersma: Heavy paths and cycles in weighted graphs. Discrete Mathematics 223(1-3): 327-336 (2000)

Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer: Closure Concepts: A Survey. Graphs and Combinatorics 16(1): 17-48 (2000)

Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller: Degree-preserving trees. Networks 35(1): 26-39 (2000)

Hajo Broersma, Cornelis Hoede: Another equivalent of the graceful tree conjecture. Ars Comb. 51 (1999)

Hajo Broersma, Erik Engbers, Huib Trommel: Various results on the toughness of graphs. Networks 33(3): 233-238 (1999)

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discrete Math. 12(2): 276-287 (1999)

Hajo Broersma, Huib Trommel: Closure concepts for claw-free graphs. Discrete Mathematics 185(1-3): 231-238 (1998)

Hajo Broersma, Hilde Tuinstra: Independence trees and Hamilton cycles. Journal of Graph Theory 29(4): 227-237 (1998)

Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra: Degree-Preserving Forests. MFCS 1998: 713-721

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. WG 1998: 88-99

H. J. Broersma: A note on the minimum size of a vertex pancyclic graph. Discrete Mathematics 164(1-3): 29-32 (1997)

H. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer: Dirac's minimum degree condition restricted to claws. Discrete Mathematics 167-168: 155-166 (1997)

Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz: Spanning trees with pairwise nonadjacent endvertices. Discrete Mathematics 170(1-3): 219-222 (1997)

Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman: Cycles through subsets with large degree sums. Discrete Mathematics 171(1-3): 43-54 (1997)

Hajo Broersma, Xueliang Li: Spanning trees with many or few colors in edge-colored graphs. Discussiones Mathematicae Graph Theory 17(2): 259-269 (1997)

Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller: Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770

Hajo Broersma, Elias Dahlhaus, Ton Kloks: Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG 1997: 109-117

Hajo Broersma, Xueliang Li: The connectivity of the leaf-exchange spanning tree graph of a graph. Ars Comb. 43 (1996)

Armen S. Asratian, H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman: On graphs satisfying a local ore-type condition. Journal of Graph Theory 21(1): 1-10 (1996)

H. J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer: Toughness and hamiltonicity in almost claw-free graphs. Journal of Graph Theory 21(4): 431-439 (1996)

H. J. Broersma, Jan van den Heuvel, B. Jackson, Henk Jan Veldman: Hamiltonicity of regular 2-connected graphs. Journal of Graph Theory 22(2): 105-124 (1996)

Thomas Böhme, H. J. Broersma, Henk Jan Veldman: Toughness and longest cycles in 2-connected planar graphs. Journal of Graph Theory 23(3): 257-263 (1996)

Douglas Bauer, H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics 141(1-3): 1-10 (1995)

H. J. Broersma, M. Lu: Cycles through particular subgraphs of claw-free graphs. Journal of Graph Theory 20(4): 459-465 (1995)

H. J. Broersma, F. Göbel: Bipartite regular graphs with fixed diameter. Networks 26(3): 139-144 (1995)

Hajo Broersma, Ingo Schiermeyer: Subgraphs, Closures and Hamiltonicity. Discrete Applied Mathematics 51(1-2): 39-46 (1994)

H. J. Broersma, Ingo Schiermeyer: A closure concept based on neighborhood unions of independent triples. Discrete Mathematics 124(1-3): 37-47 (1994)

Hajo Broersma, Xueliang Li: On "The Matching Polynomial of a Polygraph". Discrete Applied Mathematics 46(1): 79-86 (1993)

H. J. Broersma, F. Göbel: Coloring a graph optimally with two colors. Discrete Mathematics 118(1-3): 23-31 (1993)

H. J. Broersma: A note on K₄-closures in hamiltonian graph theory. Discrete Mathematics 121(1-3): 19-23 (1993)

H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman: Long cycles, degree sums and neighborhood unions. Discrete Mathematics 121(1-3): 25-35 (1993)

H. J. Broersma, Jan van den Heuvel, Henk Jan Veldman: A generalization of Ore's Theorem involving neighborhood unions. Discrete Mathematics 122(1-3): 37-49 (1993)

H. J. Broersma, Jan van den Heuvel, H. A. Jung, Henk Jan Veldman: Long paths and cycles in tough graphs. Graphs and Combinatorics 9(1): 3-17 (1993)

H. J. Broersma, Johan H. C. van den Heuvel, H. A. Jung, Henk Jan Veldman: Cycles containing all vertices of maximum degree. Journal of Graph Theory 17(3): 373-385 (1993)

H. J. Broersma, A. J. W. Duijvestijn, F. Göbel: Generating all 3-connected 4-regular planar graphs from the octahedron graph. Journal of Graph Theory 17(5): 613-620 (1993)

H. J. Broersma, Ralph J. Faudree, Johan H. C. van den Heuvel, Henk Jan Veldman: Decomposition of bipartite graphs under degree constraints. Networks 23(3): 159-164 (1993)

H. J. Broersma, Xueliang Li: The connectivity of the basis graph of a branching greedoid. Journal of Graph Theory 16(3): 233-237 (1992)

H. J. Broersma, Henk Jan Veldman: Long dominating cycles and paths in graphs with large neighborhood unions. Journal of Graph Theory 15(1): 29-38 (1991)

Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao: A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory, Ser. B 47(2): 237-243 (1989)

H. J. Broersma, Cornelis Hoede: Path graphs. Journal of Graph Theory 13(4): 427-444 (1989)

H. J. Broersma: Existence of Δ_λ-cycles and Δ_λ-paths. Journal of Graph Theory 12(4): 499-507 (1988)