[-] Broersma, H.J. and F. Göbel,
Bipartite regular graphs with
fixed diameter,
Networks 26 (1995) 139-144.
[-] Broersma, H.J. and M. Lu,
Cycles through particular subgraphs
of claw-free graphs,
Journal of Graph Theory 20 (1995)
459-465.
[-] Bauer, D., H.J. Broersma and H.J. Veldman,
On generalizing a theorem of Jung,
Ars Combinatoria 40 (1995) 207-218.
[-] Asratian, A.S., H.J. Broersma, J. van den Heuvel and H.J. Veldman,
On graphs satisfying a local Ore-type
condition,
Journal of Graph Theory 21 (1996)
1-10.
[-] Broersma, H.J., Z. Ryjácek and I. Schiermeyer,
Toughness and hamiltonicity in
almost claw-free graphs,
Journal of Graph Theory 21 (1996)
431-439.
[-] Broersma, H.J., J. van den Heuvel, B. Jackson and H.J. Veldman,
Hamiltonicity of regular 2-connected
graphs.
Journal of Graph Theory 22 (1996)
105-124.
[-] Broersma, H.J. and X. Li,
The connectivity of the leaf-exchange
spanning tree graph of a graph.
Ars Combinatoria 43 (1996) 225-231.
[-] Broersma, H.J., Z. Ryjácek and I. Schiermeyer,
Unifying results on hamiltonian
claw-free graphs.
Tatra Mountains Mathematical Publications
9 (1996) 31-39.
[-] Böhme, T., H.J. Broersma and H.J. Veldman,
Toughness and longest cycles in
2-connected planar graphs,
Journal of Graph Theory 23 (1996)
257-263.
[-] Broersma, H.J.,
A note on the minimum size of
a vertex pancyclic graph,
Discrete Mathematics 164 (1997)
29-32.
[-] Broersma, H.J., Z. Ryjácek and I. Schiermeyer,
Dirac's minimum degree condition
restricted to claws,
Discrete Mathematics 167/168 (1997)
155-166.
[-] Böhme, T., H.J. Broersma, F. Göbel, A.V. Kostochka and
M. Stiebitz,
A note on spanning trees with
pairwise nonadjacent end-vertices,
Discrete Mathematics 170 (1997)
219-222.
[-] Broersma, H.J., H. Li, J. Li, F. Tian and H.J. Veldman,
Cycles through subsets with large
degree sums,
Discrete Mathematics 171 (1997)
43-54.
[-] Broersma, H.J. and X. Li,
Spanning trees with many or few
colors in edge-colored graphs,
Discussiones Mathematicae: Graph
Theory 17 (1997) 259-270.
[-] Broersma, H.J., T. Kloks, D. Kratsch and H. Müller,
Independent sets in asteroidal
triple-free graphs,
Proceedings of the 24th
International Colloquium on Automata, Languages, and Programming
(ICALP'97), Springer-Verlag,
LNCS 1256 (1997) 760-770.
[-] Broersma, H.J., E. Dahlhaus and T. Kloks,
Algorithms for the treewidth and
minimum fill-in of HHD-free graphs,
Proceedings of the 23th International
Workshop on Graph-Theoretic Concepts in Computer Science
(WG'97), Springer-Verlag, LNCS
1335 (1997) 109-117.
[-] Broersma, H.J. and H. Trommel,
Closure concepts for claw-free
graphs,
Discrete Mathematics 185 (1998)
231-238.
[-] Broersma, H.J. and H. Tuinstra,
Independence trees and Hamilton
cycles,
Journal of Graph Theory
29 (1998) 227-237.
[-] Broersma, H.J., T. Kloks, D. Kratsch and H. Müller,
A generalization of AT-free graphs
and a generic algorithm for solving triangulation problems,
Proceedings of the 24th International
Workshop on Graph-Theoretic Concepts in Computer Science
(WG'98), Springer-Verlag, LNCS
1517 (1998) 88-99.
[-] Broersma, H.J., A.Huck, T. Kloks, O. Koppius, D. Kratsch, H. Muller
and H. Tuinstra,
Degree-preserving forests,
Proceedings of the 23th
International Symposium Mathematical Foundations of Computer Science
(MFCS'98), Springer-Verlag,
LNCS 1450 (1998) 718-721.
[-] Broersma, H.J. and C. Hoede,
Trees are graceful if and only
if trees with a perfect matching are strongly graceful,
Ars Combinatoria 51 (1999) 183-192.
[-] Böhme, T., H.J. Broersma and H. Tuinstra,
A note on a conjecture concerning
tree-partitioning 3-regular graphs,
Tatra Mountains Math. Publ. 18
(1999) 15-21.
[-] Broersma, H.J., E.A. Engbers and H. Trommel,
Various results on the toughness
of graphs,
Networks 33 (1999) 233-238.
[-] Broersma, H.J., T. Kloks, D. Kratsch and H. Müller,
Independent sets in asteroidal
triple-free graphs,
Siam J. Discrete Math. 12
(1999) 276-287.
[-] Broersma, H.J., N. Bruin, J. Hurink, L.E. Meester, S.S. Op de Beek
and J. Westhuis,
Throughput of ADSL modems,
Proceedings of the 33rd Study
Group with Industry,
CWI Syllabus 46 (1999) 11-26.