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

1999
25 Downloads (Pure)

Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion

Bauer, D., Broersma, H. J., Morgana, A. & Schmeichel, E., 1999, Enschede: Universiteit Twente. 15 p. (Memorandum / Faculty of Mathematical Sciences; no. 1499)

Research output: Book/ReportReportProfessional

File

Proc. 6th Twente Workshop on graphs and combinatorial optimization

Broersma, H. J., Faigle, U., Hoede, C. & Hurink, J. L., 1999, Amsterdam: Electronic Notes in Discrete Mathematics. 272 p.

Research output: Book/ReportBookAcademic

Throughput of ADSL modems

Broersma, H. J., Bruin, N., Hurink, J. L., Meester, L. E., op de Beek, S. S. & Westhuis, J. H., 1999, Enschede: Universiteit Twente. 18 p.

Research output: Book/ReportReportProfessional

67 Downloads (Pure)

Throughput of ADSL modems

Broersma, H. J., Bruin, N., Hurink, J. L., Meester, L. E., op de Beek, S. S., Westhuis, J. & Westhuis, J. H., 1999, Enschede: University of Twente, Department of Applied Mathematics.

Research output: Book/ReportReportOther research output

File

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
9 Citations (Scopus)

A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking

Broersma, H. J., Kloks, T., Kloks, A. J. J., Kratsch, D. & Müller, H., 1998, Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG’98, Smolenice Castle, Slovak Republic, June 18-20, 1998. Berlin: Springer, p. 88-99 12 p. (Lecture notes in computer science; vol. 1517, no. 1517).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

Broersma, H. J., Kloks, A. J. J., Kratsch, D. & Muller, H. C., 1998, Prague: Charles University, Faculty of Mathematics and Physics. 21 p.

Research output: Book/ReportReportProfessional

30 Downloads (Pure)

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

Bohme, T., Bohme, T., Broersma, H. J. & Tuinstra, H., 1998, Enschede: Universiteit Twente. 7 p. (Memorandum / University of Twente, Faculty of Applied Mathematics, ISSN 0921-1969 ; no. 1427)

Research output: Book/ReportReportProfessional

File

Closure concepts - a survey

Broersma, H. J., Ryjácek, Z. & Schiermeyer, I., 1998, Plzen, Czech Republic: Zapadoceska Univerzita. 34 p.

Research output: Book/ReportReportProfessional

10 Citations (Scopus)
25 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

Degree-preserving forests

Broersma, H. J., Huck, A., Kloks, A. J. J., Kloks, T., Koppius, O., Kratsch, D., Müller, H. & Tuinstra, H., 1998, Mathematical Foundations of Computer Science : 23rd International Symposium, MFCS '98. Berlin: Springer, p. 713-721 10 p. (Lecture Notes in Computer Science; vol. 1450, no. 1450).

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

Degree-preserving forests

Broersma, H. J., Huck, A., Kloks, A. J. J., Koppius, O., Kratsch, D., Muller, H. C. & Tuinstra, H., 1998, Prague: Charles University, Faculty of Mathematics and Physics. 25 p.

Research output: Book/ReportReportProfessional

43 Downloads (Pure)

Heavy paths and cycles in weighted graphs

Zhang, S., Li, X., Li, X. & Broersma, H. J., 1998, Enschede: Universiteit Twente. 13 p. (Memorandum Faculteit TW; no. 1428)

Research output: Book/ReportReportProfessional

File
33 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

43 Downloads (Pure)

Isomorphisms and traversability of directed path graphs

Broersma, H. J., Li, X. & Li, X., 1998, Enschede: University of Twente, Department of Applied Mathematics. 12 p. (Memorandum Faculteit TW; no. 1433)

Research output: Book/ReportReportProfessional

File
24 Downloads (Pure)

Some approaches to a conjecture on short cycles in digraphs

Broersma, H. J., Li, X. & Li, X., 1998, Enschede: Universiteit Twente. 8 p. (Memorandum Faculteit TW; no. 1479)

Research output: Book/ReportReportProfessional

File
1997

A generalization of AT-free graphs and a generic algorithm for solving triangulation problems

Broersma, H. J., Kloks, A. J. J., Kratsch, D. & Muller, H. C., 1997, Enschede: Universiteit Twente. 18 p.

Research output: Book/ReportReportProfessional

7 Citations (Scopus)
55 Downloads (Pure)

Algorithms for the treewidth and minimum fill-in of HHD-free graphs

Broersma, H. J., Dahlhaus, E., Kloks, A. J. J. & Kloks, T., 1997, Graph-Theoretic Concepts in Computer Science. Springer, p. 109-117 19 p. (Lecture notes in computer science; vol. 1335).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

File
Treewidth
Graph in graph theory
Cycle
Clique number
Induced Subgraph
6 Citations (Scopus)
23 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)
29 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
20 Citations (Scopus)
41 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
9 Citations (Scopus)
100 Downloads (Pure)

Independent sets in asteroidal triple-free graphs

Broersma, H. J., Kloks, T., Kloks, A. J. J., Kratsch, D. & Müller, H., 1997, Automata, Languages and Programming: 24th International Colloquium, ICALP '97 Bologna, Italy, July 7–11, 1997 Proceedings. Degano, P., Gorrieri, R. & Marchetti-Spaccamela, A. (eds.). Springer, p. 760-770 11 p. (Lecture notes in computer science; vol. 1256).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

File
Independent Set
Graph in graph theory
Dominating Set
Cardinality
Polynomial time

Not every 2-tough graph is Hamiltonian

Bauer, D., Broersma, H. J. & Veldman, H. J., 1997, Enschede: Universiteit Twente. 10 p.

Research output: Book/ReportReportProfessional

138 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)
33 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
36 Downloads (Pure)

Various results on the toughness of graphs

Broersma, H. J., Engbers, E. A. & Trommel, H., 1997, Enschede: Universiteit Twente. 14 p. (Memorandum / University of Twente, Faculty of Applied Mathematics; no. 1372)

Research output: Book/ReportReportProfessional

File
1996

Algorithms for the treewidth and minimum fill-in of HHD-free graphs

Broersma, H. J., Dahlhaus, E. & Kloks, A. J. J., 1996, Enschede: Universiteit Twente. 13 p.

Research output: Book/ReportReportProfessional

18 Citations (Scopus)
10 Downloads (Pure)

Directed path graphs

Broersma, H. J., Li, X. & Li, X., 1996, Enschede: Universiteit Twente. 10 p. (Memorandum; no. 1310)

Research output: Book/ReportReportProfessional

File
Path
Graph in graph theory
Line Digraph
Digraph
Isomorphism
9 Citations (Scopus)
329 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

Independence trees and Hamilton cycles

Broersma, H. J. & Tuinstra, H., 1996, Enschede: Universiteit Twente. 23 p.

Research output: Book/ReportReportProfessional

Independent sets in asteroidal triple-free graphs

Broersma, H. J., Kloks, A. J. J., Kratsch, D. & Muller, H. C., 1996, Enschede: Universiteit Twente. 18 p.

Research output: Book/ReportReportProfessional

8 Citations (Scopus)
25 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

Progress Report: EIDMA Workshop on Hamiltonicity of 2-tough graphs

Bondy, J. A., Broersma, H. J., Hoede, C. & Veldman, H. J., 1996, Enschede: Universiteit Twente. 29 p.

Research output: Book/ReportReportProfessional

Some notes on closure concepts for claw-free graphs

Broersma, H. J. & Trommel, H., 1996, Enschede: Universiteit Twente. 12 p.

Research output: Book/ReportReportProfessional

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)
30 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)
95 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

A note on spanning trees with pairwise nonadjacent end-vertices

Bohme, T., Broersma, H. J., Gobel, F., Kostochka, A. V. & Stiebitz, M., 1995, University of Twente, Faculty of Mathematical Sciences. 8 p. (Memorandum Faculty of Mathematical Sciences; no. 1266)

Research output: Book/ReportReportProfessional

1 Citation (Scopus)
50 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)
52 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

Dirac's minimum degree condition restricted to claws

Broersma, H. J., Ryjácek, Z. & Schiermeyer, I., 1995, University of Twente, Faculty of Mathematical Sciences. 17 p. (Memorandum Faculty of Mathematical Sciences; no. 1272)

Research output: Book/ReportReportProfessional

Heavy cycles in weighted graphs

Bondy, J. A., Broersma, H. J., van den Heuvel, J. P. M. & Veldman, H. J., 1995, University of Twente, Faculty of Mathematical Sciences. 14 p. (Memorandum Faculty of Mathematical Sciences; no. 1300)

Research output: Book/ReportReportProfessional

13 Citations (Scopus)
57 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
47 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

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

Broersma, H. J. & Li, X., 1995, Enschede: University of Twente. 14 p. (Memorandum Faculty of Mathematical Sciences; no. 1298)

Research output: Book/ReportReportProfessional

Toughness and longest cycles in 2-connected planar graphs

Bohme, T., Broersma, H. J. & Veldman, H. J., 1995, University of Twente, Faculty of Mathematical Sciences. 11 p. (Memorandum Faculty of Mathematical Sciences; no. 1281)

Research output: Book/ReportReportProfessional

1994
8 Citations (Scopus)
33 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

A note on the minimum size of a vertex pancyclic graph

Broersma, H. J., 1994, University of Twente, Faculty of Mathematical Sciences. 7 p. (Memorandum Faculty of Mathematical Sciences; no. 1233)

Research output: Book/ReportReportProfessional