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

2002
19 Downloads (Pure)

Isomorphisms and traversability of directed path graphs

Broersma, H. J., Li, X. & Li, X., 2002, In : Discussiones mathematicae. Graph theory. 22, 2, p. 215-228 16 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
Hamiltonians
Isomorphism
Path
Digraph
Graph in graph theory
43 Downloads (Pure)

More about subcolorings

Broersma, H. J., Fomin, F. V., Nešetřil, J. & Woeginger, G., 2002, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1635)

Research output: Book/ReportReportOther research output

Open Access
File
Vertex Coloring
Clique
Combinatorics
Disjoint
Union
14 Citations (Scopus)

More about subcolorings

Broersma, H. J., Fomin, F. V., Nesetril, J. & Woeginger, G., 2002, In : Computing. 69, 3, p. 187-203 7 p.

Research output: Contribution to journalArticleAcademicpeer-review

Coloring
Permutation Graphs
Polynomials
Color
Planar graph
48 Downloads (Pure)

More on spanning 2-connected subgraphs in truncated rectangular grid graphs

Salman, M., Baskoro, E. T. & Broersma, H. J., 2002, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1637)

Research output: Book/ReportReportOther research output

Open Access
File
Grid Graph
Subgraph
Graph in graph theory
Cycle
Hamilton Cycle
39 Downloads (Pure)

More Progress on Tough Graphs - The Y2K Report

Bauer, D., Broersma, H. & Schmeichel, E., Jul 2002, In : Electronic notes in discrete mathematics. 11, p. 63-80

Research output: Contribution to journalConference articleAcademicpeer-review

Open Access
File
Hamiltonians
Toughness
Graph in graph theory
Continue
Cycle
16 Citations (Scopus)
36 Downloads (Pure)

On some intriguing problems in hamiltonian graph theory - a survey

Broersma, H. J., 2002, In : Discrete mathematics. 251, 1-3, p. 47-69 23 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonian Graph
Hamiltonians
Claw-free Graphs
Graph theory
Regular Graph
39 Downloads (Pure)

On stability of the Hamiltonian index under contractions and closures

Xiong, L., Ryjáček, Z. & Broersma, H. J., 2002, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1622)

Research output: Book/ReportReportOther research output

Open Access
File
1 Citation (Scopus)

Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous

Broersma, H. J., Fomin, F. V., Kratochvíl, J. & Woeginger, G., 2002, Algorithm Theory — SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory Turku, Finland, July 3–5, 2002 Proceedings. Penttonen, M. & Meineche Schmidt, E. (eds.). Springer, p. 160-169 (Lecture notes in computer science; vol. 2368).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
23 Downloads (Pure)

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

Bauer, D., Broersma, H. J., Morgana, A. & Schmeichel, E., 2002, In : Discrete applied mathematics. 120, 1-3, p. 13-23 11 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Hamiltonians
Polynomial Algorithm
NP-complete problem
Polynomials
Imply
3 Citations (Scopus)
34 Downloads (Pure)

Radio labeling with pre-assigned frequencies

Bodlaender, H. L., Broersma, H. J., Fomin, F. V., Pyatkin, A. V. & Woeginger, G. J., 2002, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1636)

Research output: Book/ReportReportOther research output

Open Access
File
Labeling
Transmitter
Frequency Assignment
Assignment Problem
Pairwise

Radio Labeling with Pre-assigned Frequencies

Bodlaender, H. L., Broersma, H. J., Fomin, F. V., Pyatkin, A. & Woeginger, G., 2002, Algorithms — ESA 2002: 10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings. Möhring, R. & Raman, R. (eds.). Berlin: Springer, p. 211-222 (Lecture Notes in Computer Science; vol. 2461).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

Labeling
Graph in graph theory
Transmitter
Colouring
Frequency Assignment

Run-Time adaptivity for Software Defined Radio

Smit, L. T., Smit, G. J. M., Hurink, J. L. & Broersma, H. J., 2002, Proceedings 3rd workshop on Embedded Systems. p. 218-224

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

19 Downloads (Pure)

Run-Time Control For Software Defined Radio

Smit, L. T., Smit, G. J. M., Havinga, P. J. M., Hurink, J. L. & Broersma, H. J., Oct 2002, 3rd PROGRESS workshop on Embedded Systems. Utrecht, The Netherlands: STW, p. 218-223 6 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

File
3 Citations (Scopus)
1 Downloads (Pure)

Some approaches to a conjecture on short cycles in digraphs

Broersma, H. J., Li, X. & Li, X., 2002, In : Discrete applied mathematics. 120, 1-3, p. 45-93 9 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Digraph
Toughness
Cycle
Clique number
Local Structure
48 Downloads (Pure)

Spanning 2-connected subgraphs in truncated rectangular grid graphs

Salman, A. N. M., Baskoro, E. T. & Broersma, H. J., 2002, Enschede: University of Twente, Department of Applied Mathematics. 8 p. (Memorandum; no. 1630)

Research output: Book/ReportReportOther research output

File
Grid Graph
Subgraph
Graph in graph theory
Cycle
Hamilton Cycle
51 Downloads (Pure)

Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs

Salman, M., Baskoro, E. T. & Broersma, H. J., 2002, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1629)

Research output: Book/ReportReportOther research output

File
73 Downloads (Pure)

Stars and bunches in planar graphs. Part I: Triangulations

Borodin, O. V., Broersma, H. J., Glebov, A. & van den Heuvel, J., 2002, Enschede: University of Twente, Department of Applied Mathematics. 18 p. (Memorandum Faculteit TW; no. 1632)

Research output: Book/ReportReportProfessional

File
82 Downloads (Pure)

Stars and bunches in planar graphs. Part II: General planar graphs and colourings

Borodin, O. V., Broersma, H. J., Glebov, A. & van den Heuvel, J., 2002, Enschede: University of Twente, Department of Applied Mathematics. 19 p. (Memorandum Faculteit TW; no. 1633)

Research output: Book/ReportReportProfessional

File
51 Downloads (Pure)

The Ramsey numbers of large cycles versus small wheels

Surahmat, Baskoro, E. T. & Broersma, H. J., 2002, Enschede: University of Twente, Department of Applied Mathematics. 6 p. (Memorandum; no. 1634)

Research output: Book/ReportReportOther research output

File
Ramsey number
Wheel
Subgraph
Cycle
Graph in graph theory
42 Downloads (Pure)

The Ramsey numbers of large star-like trees versus large odd wheels

Surahmat, Baskoro, E. T. & Broersma, H. J., 2002, Enschede: University of Twente, Department of Applied Mathematics. 9 p. (Memorandum; no. 1621)

Research output: Book/ReportReportOther research output

File
Ramsey number
Wheel
Odd
Subgraph
Graph in graph theory
2001
14 Downloads (Pure)

A sigma 3 type condition for heavy cycles in weighted graphs

Broersma, H. J., Zhang, S., Li, X. & Li, X., 2001, In : Discussiones mathematicae. Graph theory. 21, 2, p. 159-166 8 p.

Research output: Contribution to journalArticleAcademicpeer-review

File
Weighted Graph
Cycle
Connected graph
Degree Sum
Hamilton Cycle

A structural theorem on planar triangulations in terms of bunches and stars

Borodin, O. V., Broersma, H. J., Glebov, A. S. & van den Heuvel, J., 2001, In : Discrete analysis and operations research. 8, 2, p. 15-39 24 p.

Research output: Contribution to journalArticleAcademicpeer-review

9 Downloads (Pure)

Circuits in graphs and the Hamiltonian index

Liming, X., 13 Jun 2001, Enschede: Twente University Press (TUP). 161 p.

Research output: ThesisPhD Thesis - Research UT, graduation UTAcademic

File

Distant-2-colouring in planar graphs

Borodin, O. V., Broersma, H. J., Glebov, A. S. & van den Heuvel, J., 2001, In : Discrete analysis and operations research. 8, 4, p. 9-33 24 p.

Research output: Contribution to journalArticleAcademicpeer-review

32 Citations (Scopus)

On factors of 4-connected claw-free graphs

Broersma, H. J., Kriesell, M., Kriesell, M. & Ryjacek, Z., 2001, In : Journal of graph theory. 37, 2, p. 125-136 12 p.

Research output: Contribution to journalArticleAcademicpeer-review

Preface. Volume 8

Broersma, H., Faigle, U., Hurink, J. & Pickl, S., 1 Jan 2001, In : Electronic notes in discrete mathematics. 8, 1 p.

Research output: Contribution to journalArticleAcademicpeer-review

Combinatorial optimization
Combinatorial Optimization
Graph in graph theory
Computer science
Discrete mathematics
12 Citations (Scopus)
13 Downloads (Pure)

Strengthening the closure concept in claw-free graphs

Broersma, H. J. & Ryjacek, Z., 2001, In : Discrete mathematics. 233, 1-3, p. 55-63 9 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Claw-free Graphs
Strengthening
Closure
Circumference
Complete Graph
9 Downloads (Pure)

Subpancyclicity in the line graph of a graph with large degree sums of vertices along a path

Xiong, L., Broersma, H. J. & Hoede, C., 2001, Enschede: University of Twente, Department of Applied Mathematics. 13 p. (Memorandum; no. 1606)

Research output: Book/ReportReportOther research output

File
Degree Sum
Line Graph
Path
Graph in graph theory
Circumference
39 Downloads (Pure)

The Hamiltonian index of a graph and its branch-bonds

Xiong, L., Liming, X., Broersma, H. J., Li, X. & Li, X., 2001, Enschede: University of Twente. 13 p. (Memorandum Faculteit TW; no. 1611)

Research output: Book/ReportReportProfessional

File
9 Downloads (Pure)

Toughness and hamiltonicity in $k$-trees

Broersma, H. J., Xiong, L. & Yoshimoto, K., 2001, Enschede: University of Twente, Department of Applied Mathematics. 10 p. (Memorandum; no. 1576)

Research output: Book/ReportReportOther research output

File
K-tree
Hamiltonicity
Toughness
Chordal Graphs
Hamiltonian circuit
2000
17 Downloads (Pure)

A $\sigma_3$ type condition for heavy cycles in weighted graphs

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

Research output: Book/ReportReportProfessional

File
8 Downloads (Pure)

A fan type condition for heavy cycles in weighted graphs

Broersma, H., Zhang, S., Li, X. & Wang, L., 2000, Enschede: University of Twente, Department of Applied Mathematics. 13 p. (Memorandum Faculteit TW; no. 1513)

Research output: Book/ReportReportProfessional

Open Access
File
Weighted Graph
Cycle
Hamilton Cycle
Long Cycle
Graph in graph theory
19 Citations (Scopus)
3 Downloads (Pure)

A linear time algorithm for minimum fill-in and treewidth for distance heredity graphs

Broersma, H. J., Dahlhaus, E., Kloks, A. J. J. & Kloks, T., 2000, In : Discrete applied mathematics. 99, 1-3, p. 367-400 34 p.

Research output: Contribution to journalArticleAcademicpeer-review

Open Access
File
Distance Graph
Treewidth
Linear-time Algorithm
Distance-hereditary Graphs
Clique number
21 Citations (Scopus)

Closure concepts - a survey

Broersma, H. J., Ryjácek, Z. & Schiermeyer, I., 2000, In : Graphs and combinatorics. 2000, 16, p. 17-48 32 p.

Research output: Contribution to journalArticleAcademicpeer-review

13 Citations (Scopus)

Degree-preserving trees

Broersma, H. J., Kloks, A. J. J., Koppius, O., Tuinstra, H., Huck, A., Kloks, T., Kratsch, D. & Müller, H., 2000, In : Networks. 35, 1, p. 26-39 14 p.

Research output: Contribution to journalArticleAcademicpeer-review

Approximation algorithms
Electric power distribution
Computational complexity
Polynomials
Water
10 Downloads (Pure)

Directed paths with few or many colors in colored directed graphs

Li, X., Li, X., Zhang, S. & Broersma, H. J., 2000, Enschede: University of Twente, Department of Applied Mathematics. 16 p. (Memorandum Faculteit TW; no. 1543)

Research output: Book/ReportReportProfessional

File
18 Citations (Scopus)
61 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
41 Downloads (Pure)

More progress on tough graphs -- The Y2K report

Bauer, D., Broersma, H. J. & Schmeichel, E., 2000, Enschede: Universiteit Twente. 19 p. (Memorandum / Faculty of Mathematical Sciences; no. 1536)

Research output: Book/ReportReportProfessional

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

On compact models for high-voltage MOS devices

van Beckum, F. P. H., Broersma, H. J., Habets, L. C. G. J. M., Meinsma, G., Molenaar, J., Schilders, W. H. A. & van de Ven, A. A. F., 1 Jan 2000, Proc. of the 36th European Study Group with Industry, EUT-Report 00-WSK-0. Eindhoven, p. 11-23 13 p.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

28 Downloads (Pure)

Strengthening the closure concept in claw-free graphs

Broersma, H. J. & Ryjacek, Z., 2000, Enschede: Universiteit Twente. 13 p. (Memorandum / Faculty of Mathematical Sciences; no. 1512)

Research output: Book/ReportReportProfessional

File
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

Forbidden subgraphs that imply Hamiltonian-connectedness

Broersma, H. J., Faudree, R. J., Huck, A., Trommel, H. & Veldman, H. J., 1999, Enschede: Universiteit Twente. 20 p.

Research output: Book/ReportReportProfessional

53 Downloads (Pure)

Forbidden subgraphs that imply Hamiltonian-connectedness

Broersma, H. J., Faudree, R. J., Huck, A., Trommel, H. & Veldman, H. J., 1999, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum / Faculty of Mathematical Sciences; no. 1481)

Research output: Book/ReportReportOther research output

File
57 Citations (Scopus)
43 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
34 Downloads (Pure)

On factors of 4-connected claw-free graphs

Broersma, H. J., Kriesell, M., Kriesell, M. & Ryjacek, Z., 1999, Enschede: University of Twente, Department of Applied Mathematics. 13 p. (Memorandum / Department of Applied Mathematics; no. 1491)

Research output: Book/ReportReportProfessional

File

On minimum degree conditions for supereulerian graphs

Broersma, H. J. & Xiong, N., 1999, Enschede: Universiteit Twente. 10 p.

Research output: Book/ReportReportProfessional

19 Downloads (Pure)

On minimum degree conditions for supereulerian graphs

Broersma, H. J. & Xiong, L., 1999, Enschede: University of Twente, Department of Applied Mathematics.

Research output: Book/ReportReportOther research output

File
165 Downloads (Pure)
File