Haitze J. Broersma

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 1

Top Topics

Multiple Scales

Top Venues

Discuss. Math. Graph Theory

Publications

Tao Tian, Haitze J. Broersma, Liming Xiong
Edge degree conditions for dominating and spanning closed trails. Discuss. Math. Graph Theory 44 (1) (2024)
Mingchu Li, Lifeng Yuan, He Jiang, Bing Liu, Haitze J. Broersma
Tank-Ring Factors in Supereulerian Claw-Free Graphs. Graphs Comb. 29 (3) (2013)
Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
Toughness and Vertex Degrees. J. Graph Theory 72 (2) (2013)
Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel
Degree Sequences and the Existence of k-Factors. Graphs Comb. 28 (2) (2012)
Haitze J. Broersma, Zdenek Ryjácek, Petr Vrána
How Many Conjectures Can You Stand? A Survey. Graphs Comb. 28 (1) (2012)
Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto
lambda-backbone colorings along pairwise disjoint stars and matchings. Discret. Math. 309 (18) (2009)
Mingchu Li, Liming Xiong, Haitze J. Broersma
Connected even factors in claw-free graphs. Discret. Math. 308 (11) (2008)
A. N. M. Salman, Haitze J. Broersma
Path-kipas Ramsey numbers. Discret. Appl. Math. 155 (14) (2007)
A. N. M. Salman, Haitze J. Broersma
The Ramsey Numbers of Paths Versus Kipases. Electron. Notes Discret. Math. 17 (2004)
A. N. M. Salman, Haitze J. Broersma
The Ramsey Numbers of Paths Versus Fans. Electron. Notes Discret. Math. 13 (2003)
Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek
On factors of 4-connected claw-free graphs. J. Graph Theory 37 (2) (2001)
Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer
Dirac's minimum degree condition restricted to claws. Discret. Math. (1997)
Haitze J. Broersma
A note on the minimum size of a vertex pancyclic graph. Discret. Math. 164 (1-3) (1997)
Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman
Toughness and longest cycles in 2-connected planar graphs. J. Graph Theory 23 (3) (1996)
Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman
Hamiltonicity of regular 2-connected graphs. J. Graph Theory 22 (2) (1996)
Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
On graphs satisfying a local ore-type condition. J. Graph Theory 21 (1) (1996)
Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer
Toughness and hamiltonicity in almost claw-free graphs. J. Graph Theory 21 (4) (1996)
Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. 141 (1-3) (1995)
Haitze J. Broersma, M. Lu
Cycles through particular subgraphs of claw-free graphs. J. Graph Theory 20 (4) (1995)
Haitze J. Broersma, F. Göbel
Bipartite regular graphs with fixed diameter. Networks 26 (3) (1995)
Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman
On generalizing a theorem of Jung. Ars Comb. 40 (1995)
Haitze J. Broersma, Ingo Schiermeyer
A closure concept based on neighborhood unions of independent triples. Discret. Math. 124 (1-3) (1994)
Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
Long cycles, degree sums and neighborhood unions. Discret. Math. 121 (1-3) (1993)
Haitze J. Broersma, Jan van den Heuvel, H. A. Jung, Henk Jan Veldman
Cycles containing all vertices of maximum degree. J. Graph Theory 17 (3) (1993)
Haitze J. Broersma, A. J. W. Duijvestijn, F. Göbel
Generating all 3-connected 4-regular planar graphs from the octahedron graph. J. Graph Theory 17 (5) (1993)
Haitze J. Broersma
-closures in hamiltonian graph theory. Discret. Math. 121 (1-3) (1993)
Haitze J. Broersma, F. Göbel
Coloring a graph optimally with two colors. Discret. Math. 118 (1-3) (1993)
Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman
Decomposition of bipartite graphs under degree constraints. Networks 23 (3) (1993)
Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman
A generalization of Ore's Theorem involving neighborhood unions. Discret. Math. 122 (1-3) (1993)
Haitze J. Broersma, Jan van den Heuvel, H. A. Jung, Henk Jan Veldman
Long paths and cycles in tough graphs. Graphs Comb. 9 (1) (1993)
Haitze J. Broersma, Xueliang Li
The connectivity of the basis graph of a branching greedoid. J. Graph Theory 16 (3) (1992)
Haitze J. Broersma, Andy Liu, L. V. Saxton
An Affirmative Action Graph (D. J. Newman). SIAM Rev. 34 (4) (1992)
Haitze J. Broersma, Henk Jan Veldman
Long dominating cycles and paths in graphs with large neighborhood unions. J. Graph Theory 15 (1) (1991)
Haitze J. Broersma, Cornelis Hoede
Path graphs. J. Graph Theory 13 (4) (1989)
Haitze J. Broersma
-paths. J. Graph Theory 12 (4) (1988)
Haitze J. Broersma, Henk Jan Veldman
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11 (3) (1987)