Publications of Hajo Broersma

The publications up to 1996 are listed below.
For the journal papers published from 1995-1999 click 95-99.
For a selection of the most recent papers click 2000, 2001 or 2002.

Published papers (ordered chronologically)

--: Broersma, H.J. and I.W. Molenaar, Interpretation of Statistical software output: some behavioral studies, COMPSTAT (1984) 341-346.
--: Broersma, H.J. and I.W. Molenaar, Graphical perception of distributional aspects of data, Computational Statistics Quarterly 2 (1985) 53-72.
--: Broersma, H.J., Subgraph conditions for dominating circuits in graphs and pancyclicity of line graphs, Ars Combinatoria 23 (1987) 5-12.
--: Broersma, H.J. and H.J. Veldman, 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian, Journal of Graph Theory 11 (1987) 399-407.
--: Broersma, H.J., Hamilton cycles in graphs and related topics, PhD-Thesis: University of Twente (1988), 113 pages.
--: Broersma, H.J., Existence of $\Delta\sb{\lambda}$-cycles and $\Delta\sb{\lambda}$-paths, Journal of Graph Theory 12 (1988) 499-507.
--: Broersma, H.J. and A.A. Jagers, The unique 4-regular graphs on 14 and 15 vertices with diameter 2, Ars Combinatoria 25C (1988) 55-62.
--: Bauer, D., H.J. Broersma, H.J. Veldman and Li Rao, A generalization of a result of Häggkvist and Nicoghossian, Journal of Combinatorial Theory (B) 47 (1989) 237-243.
--: Broersma, H.J., A note on hamiltonian graphs, Annals of Discrete Mathematics 41 (1989) 71-74.
--: Broersma, H.J. and C. Hoede, Path graphs, Journal of Graph Theory 13 (1989) 427-444.
--: Broersma, H.J. and F. Göbel, k-Traversable graphs, Ars Combinatoria 29A (1990) 141-153.
--: Broersma, H.J. and H.J. Veldman, Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of claw-free graphs, in: R. Bodendiek (Ed.), Contemporary Methods in Graph Theory (BI-Verlag, 1990) 181-194.
--: Ainouche, A., H.J. Broersma, R. Shi and H.J. Veldman, Remarks on hamiltonian properties of claw-free graphs, Ars Combinatoria 29C (1990) 110-121.
--: Bauer, D., H.J. Broersma and H.J. Veldman, On smallest nonhamiltonian regular tough graphs, Congressus Numerantium 70 (1990) 95-98.
--: Bauer, D., H.J. Broersma and H.J. Veldman, Around three lemmas in hamiltonian graph theory, in: R. Bodendiek and R. Henn (Eds.), Topics in Combinatorics and Graph Theory (Physica-Verlag, Heidelberg, 1990) 101-110.
--: Broersma, H.J. and H.J. Veldman, Long dominating cycles and paths in graphs with large neighborhood unions, Journal of Graph Theory 15 (1991) 29-38.
--: Broersma, H.J. and X. Li, The connectivity of the basis graph of a branching greedoid, Journal of Graph Theory 16 (1992) 233-237.
--: Broersma, H.J., J. van den Heuvel, H.A. Jung and H.J. Veldman, Long paths and cycles in tough graphs, Graphs and Combinatorics 9 (1993) 3-17.
--: Broersma, H.J., J. van den Heuvel, H.A. Jung and H.J. Veldman, Cycles containing all vertices of maximum degree, Journal of Graph Theory 17 (1993) 373-385.
--: Broersma, H.J., R.J. Faudree, J. van den Heuvel and H.J. Veldman, Decomposition of bipartite graphs under degree constraints, Networks 23 (1993) 159-164.
--: Broersma, H.J. and F. Göbel, Coloring a graph optimally with two colors, Discrete Mathematics 118 (1993) 23-31.
--: Broersma, H.J. and X. Li, On ``The matching polynomial of a polygraph'', Discrete Applied Mathematics 46 (1993) 79-86.
--: Broersma, H.J., A note on K4-closures in hamiltonian graph theory, Discrete Mathematics 121 (1993) 19-23.
--: Broersma, H.J., J. van den Heuvel and H.J. Veldman, Long cycles, degree sums and neighborhood unions, Discrete Mathematics 121 (1993) 25-35.
--: Broersma, H.J., A.J.W. Duijvestijn and F. Göbel, Generating all 3-connected 4-regular planar graphs from the Octahedron Graph, Journal of Graph Theory 17 (1993) 613-620.
--: Broersma, H.J., J. van den Heuvel and H.J. Veldman, A generalization of Ore's Theorem involving neighborhood unions, Discrete Mathematics 122 (1993) 37-49.
--: Bauer, D., H.J. Broersma, J. van den Heuvel and H.J. Veldman, On hamiltonian properties of 2-tough graphs, Journal of Graph Theory 18 (1994) 539-543.
--: Broersma, H.J. and I. Schiermeyer, Subgraphs, closures and hamiltonicity, Discrete Applied Mathematics 51 (1994) 39-46.
--: Broersma, H.J. and I. Schiermeyer, A closure concept based on neighborhood unions of independent triples, Discrete Mathematics 124 (1994) 37-47.
--: Bauer, D., H.J. Broersma, J. van den Heuvel and H.J. Veldman, Long cycles in graphs with prescribed toughness and minimum degree, Discrete Mathematics 141 (1995) 1-10.
--: 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.