No photo of Hajo Broersma

Hajo Broersma

prof.dr.ir.

1987 …2019
If you made any changes in Pure these will be visible here soon.

Research Output 1987 2019

Filter
Article
2000
18 Citations (Scopus)
62 Downloads (Pure)

Heavy paths and cycles in weighted graphs

Zhang, S., Li, X., Li, X. & Broersma, H. J., 2000, In : Discrete mathematics. 2000, 223, p. 327-336 10 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Weighted Graph
Joining
Cycle
Path
Vertex of a graph
42 Citations (Scopus)
11 Downloads (Pure)

Not every 2-tough graph is hamiltonian

Broersma, H. J., Bauer, D. & Veldman, H. J., 2000, In : Discrete applied mathematics. 2000, 99, p. 317-321 5 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamilton Path
Hamiltonians
Chordal Graphs
Graph in graph theory
Arbitrary
1999

A note on a conjecture concerning tree-partitioning 3-regular graphs

Bohme, T., Broersma, H. J. & Tuinstra, H., 1999, In : Tatra mountains mathematical publications. 18, p. 15-21 7 p.

Research output: Contribution to journalArticleAcademic

9 Citations (Scopus)

Another equivalent of the graceful tree conjecture

Broersma, H. J. & Hoede, C., 1999, In : Ars combinatoria. 51, p. 183-192 10 p.

Research output: Contribution to journalArticleAcademicpeer-review

57 Citations (Scopus)
44 Downloads (Pure)

Independent sets in asteroidal triple-free graphs

Broersma, H. J., Kloks, T., Kloks, A. J. J., Kratsch, D. & Müller, H., 1999, In : SIAM journal on discrete mathematics. 12, 2, p. 276-287 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
Independent Set
Graph in graph theory
Dominating Set
Polynomial time
NP-complete problem

Throughput of ADSL modems

Broersma, H. J., Bruin, N., Hurink, J. L., Meester, L. E., op de Beek, S. S. & Westhuis, J. H., 1999, In : CWI quarterly. 46, p. 11-26 16 p.

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)

Various results on the toughness of graphs

Broersma, H. J., Engbers, E. & Trommel, H., 1999, In : Networks. 33, 33, p. 233-238 6 p.

Research output: Contribution to journalArticleAcademicpeer-review

1998
10 Citations (Scopus)
33 Downloads (Pure)

Closure concepts for claw-free graphs

Broersma, H. J. & Trommel, H., 1998, In : Discrete mathematics. 185, 185, p. 231-238 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Claw-free Graphs
Closure
Triangle-free Graph
Spanning Subgraph
Line Graph
37 Citations (Scopus)

Independence Trees and Hamilton Cycles

Broersma, H. J. & Tuinstra, H., 1998, In : Journal of graph theory. 29, 29, p. 227-237 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

1997
6 Citations (Scopus)
30 Downloads (Pure)

A note on the minimum size of a vertex pancyclic graph

Broersma, H. J., 1997, In : Discrete mathematics. 164, 164, p. 29-32 4 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
28 Citations (Scopus)
41 Downloads (Pure)

Cycles through subsets with large degree sums

Broersma, H. J., Li, H., Li, J., Tian, F. & Veldman, H. J., 1997, In : Discrete mathematics. 171, p. 43-54 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Degree Sum
Hamiltonians
Cycle
Subset
Denote
21 Citations (Scopus)
47 Downloads (Pure)

Dirac's minimum degree condition restricted to claws

Broersma, H. J., Ryjacek, Z. & Schiermeyer, I., 1997, In : Discrete mathematics. 167-16, 167, p. 155-166 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Claw
Degree Condition
Hamilton Cycle
Minimum Degree
Ores
155 Downloads (Pure)

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

Broersma, H. J., Li, X. & Li, X., 1997, In : Discussiones mathematicae. Graph theory. 17, 2, p. 259-270 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
Edge-colored Graph
Spanning tree
Color
Coloring
Computational complexity
10 Citations (Scopus)
39 Downloads (Pure)

Spanning trees with pairwise nonadjacent endvertices

Böhme, T., Bohme, T., Broersma, H. J., Gobel, F., Kostochka, A. V. & Stiebitz, M., 1997, In : Discrete mathematics. 170, 170, p. 219-222 4 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
1996
9 Citations (Scopus)
367 Downloads (Pure)

Hamiltonicity of regular 2-connected graphs

Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J., Jackson, B. & Veldman, H. J., 1996, In : Journal of graph theory. 22, 2, p. 105-124 20 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
8 Citations (Scopus)
34 Downloads (Pure)

On graphs satisfying a local Ore-type condition

Asratian, A. S., Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J. & Veldman, H. J., 1996, In : Journal of graph theory. 21, 21, p. 1-10 10 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
13 Citations (Scopus)

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

Broersma, H. J. & Li, X., 1996, In : Ars combinatoria. 43, p. 225-231 7 p.

Research output: Contribution to journalArticleAcademicpeer-review

12 Citations (Scopus)
36 Downloads (Pure)

Toughness and Hamiltonicity in almost claw-free graphs

Broersma, H. J., Ryjacek, Z. & Schiermeyer, I., 1996, In : Journal of graph theory. 21, 4, p. 431-439 9 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
2 Citations (Scopus)
105 Downloads (Pure)

Toughness and longest cycles in 2-connected planar graphs

Bohme, T., Böhme, T., Broersma, H. J. & Veldman, H. J., 1996, In : Journal of graph theory. 23, 3, p. 257-263 7 p.

Research output: Contribution to journalArticleAcademicpeer-review

File

Unifying results on Hamiltonian Claw-Free graphs

Broersma, H. J., Ryjácek, Z. & Schiermeyer, I., 1996, In : Tatra mountains mathematical publications. 9, p. 31-39 9 p.

Research output: Contribution to journalArticleAcademic

1995
1 Citation (Scopus)
64 Downloads (Pure)

Bipartite regular graphs with fixed diameter

Broersma, H. J. & Gobel, F., 1995, In : Networks. 26, 26, p. 139-144 6 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
13 Citations (Scopus)
66 Downloads (Pure)

Cycles through particular subgraphs of claw-free graphs

Broersma, H. J. & Lu, M., 1995, In : Journal of graph theory. 20, 20, p. 459-465 67 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
13 Citations (Scopus)
62 Downloads (Pure)

Long cycles in graphs with prescribed toughness and minimum degree

Bauer, D., Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J. & Veldman, H. J., 1995, In : Discrete mathematics. 141, 141, p. 1-10 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonians
Long Cycle
Toughness
Minimum Degree
Cycle
48 Citations (Scopus)

On generalizing a theorem of Jung

Bauer, D., Broersma, H. J. & Veldman, H. J., 1995, In : Ars combinatoria. 40, p. 207-218 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

1994
8 Citations (Scopus)
38 Downloads (Pure)

A closure concept based on neighborhood unions of independent triples

Broersma, H. J. & Schiermeyer, I., 1994, In : Discrete mathematics. 124, 1-3, p. 37-47 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Closure
Union
Degree Sum
Generalise
Concepts
9 Citations (Scopus)

On hamiltonian properties of 2-tough graphs

Bauer, D., Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J., 1994, In : Journal of graph theory. 18, p. 539-543 5 p.

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
222 Downloads (Pure)

Subgraphs, Closures and Hamiltonicity

Broersma, H. J. & Schiermeyer, I., 1994, In : Discrete applied mathematics. 51, 1-2, p. 39-46 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonians
Hamiltonicity
Subgraph
Closure
Hamiltonian Graph
1993
19 Citations (Scopus)
62 Downloads (Pure)

A generalization of Ore's Theorem involving neighborhood unions

Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J. & Veldman, H. J., 1993, In : Discrete mathematics. 122, 122, p. 37-49 13 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
9 Citations (Scopus)
430 Downloads (Pure)

A note on K4-closures in Hamiltonian graph theory

Broersma, H. J., 1993, In : Discrete mathematics. 121, 121, p. 19-23 5 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonian Graph
Hamiltonians
Graph theory
Closure
If and only if
1 Citation (Scopus)
30 Downloads (Pure)

Coloring a graph optimally with two colors

Broersma, H. J. & Gobel, F., 1993, In : Discrete mathematics. 118, 1-3, p. 23-31

Research output: Contribution to journalArticleAcademic

Open Access
File
4 Citations (Scopus)
40 Downloads (Pure)

Cycles containing all vertices of maximum degree

Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J., Jung, H. A. & Veldman, H. J., 1993, In : Journal of graph theory. 17, 17, p. 373-385 13 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
47 Downloads (Pure)

Decomposition of bipartite graphs under degree constraints

Broersma, H. J., Faudree, R. J., van den Heuvel, J., van den Heuvel, J. P. M. & Veldman, H. J., 1993, In : Networks. 23, 23, p. 159-164 6 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
20 Citations (Scopus)
468 Downloads (Pure)

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

Broersma, H. J., Duijvestijn, A. J. W., Duijvestijn, A. J. W. & Gobel, F., 1993, In : Journal of graph theory. 17, 5, p. 613-620 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
Octahedron
Regular Graph
Planar graph
Graph in graph theory
Alternatives
5 Citations (Scopus)
18 Downloads (Pure)

Long cycles, degree sums and neighborhoods unions

Broersma, H. J., van den Heuvel, J. P. M., van den Heuvel, J. & Veldman, H. J., 1993, In : Discrete mathematics. 121, 121, p. 25-35 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
7 Citations (Scopus)

Long paths and cycles in tough graphs

Broersma, H. J., van den Heuvel, J. P. M., Jung, H. A. & Veldman, H. J., 1993, In : Graphs and combinatorics. 9, p. 3-17 15 p.

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
24 Downloads (Pure)

On "The matching polynomial of a polygraph"

Broersma, H. J., Li, X. & Li, X., 1993, In : Discrete applied mathematics. 46, 1, p. 79-86 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Matching Polynomial
Recurrence relation
Polynomials
Symmetry
1992
8 Citations (Scopus)
49 Downloads (Pure)

The connectivity of the basis graph of a branching greedoid

Broersma, H. J., Li, X. & Li, X., 1992, In : Journal of graph theory. 16, 3, p. 233-237 5 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
Branching
Connectivity
Graph in graph theory
Multigraph
Roots
1991
7 Citations (Scopus)
55 Downloads (Pure)

Long dominating cycles and paths in graphs with large neighborhood unions

Broersma, H. J. & Veldman, H. J., 1991, In : Journal of graph theory. 0, 15, p. 29-40 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
1990

k-Traversable graphs

Broersma, H. J. & Gobel, F., 1990, In : Ars combinatoria. 0, p. 141-153 13 p.

Research output: Contribution to journalArticleAcademicpeer-review

On smallest nonhamiltonian regular tough graphs

Bauer, D., Broersma, H. J. & Veldman, H. J., 1990, In : Congressus numerantium. 0, 70, p. 95-98 4 p.

Research output: Contribution to journalArticleAcademicpeer-review

Remarks on hamiltonian properties of claw-free graphs

Ainouche, A., Broersma, H. J. & Veldman, H. J., 1990, In : Ars combinatoria. 0, p. 110-121 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

1989
29 Citations (Scopus)
45 Downloads (Pure)

A generalization of a result of Häggkvist and Nicoghossian

Bauer, D., Broersma, H. J., Veldman, H. J. & Rao, L., 1989, In : Journal of Combinatorial Theory, Series B. 47, 2, p. 237-243

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonians
Connected graph
Closure
Connectivity
Theorem
42 Citations (Scopus)
217 Downloads (Pure)

Path graphs

Broersma, H. J. & Hoede, C., Sep 1989, In : Journal of graph theory. 13, 4, p. 427-444 18 p.

Research output: Contribution to journalArticleAcademic

File
Path
Graph in graph theory
Hamiltonian Graph
Unicyclic Graph
Line Graph
1988
10 Citations (Scopus)
43 Downloads (Pure)

Existence of Δλ-cycles and Δλ-paths

Broersma, H. J., 1988, In : Journal of graph theory. 12, 4, p. 499-507

Research output: Contribution to journalArticleAcademic

File
1987
15 Citations (Scopus)
74 Downloads (Pure)

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

Broersma, H. J. & Veldman, H. J., 1987, In : Journal of graph theory. 11, 3, p. 399-407

Research output: Contribution to journalArticleAcademic

File