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
Report
2004
37 Downloads (Pure)

On Ramsey numbers for paths versus wheels

Salman, M. & Broersma, H. J., 2004, Enschede: University of Twente, Department of Applied Mathematics.

Research output: Book/ReportReportOther research output

File

On Ramsey numbers for paths versus wheels

Salman, M. & Broersma, H. J., 2004, Enschede: Toegepaste Wiskunde. 12 p. (Memorandum afdeling TW; no. 1742)

Research output: Book/ReportReportProfessional

24 Downloads (Pure)

Path-kipas Ramsey numbers

Salman, M. & Broersma, H. J., 2004, Enschede: Toegepaste Wiskunde. 11 p. (Memorandum afdeling TW; no. 1743)

Research output: Book/ReportReportProfessional

File
2003
10 Downloads (Pure)

A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs

Salman, M., Broersma, H. J. & Rodger, C. A., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1700)

Research output: Book/ReportReportOther research output

Open Access
File
Grid Graph
Continuation
Subgraph
Graph in graph theory
Cycle
29 Downloads (Pure)

A general framework for coloring problems: old results, new results, and open problems

Broersma, H. J., 2003, Enschede: University of Twente, Department of Applied Mathematics. 14 p. (Memorandum; no. 1704)

Research output: Book/ReportReportOther research output

File
Colouring
Open Problems
Frequency Assignment
Biased
Framework
7 Downloads (Pure)

Backbone colorings along perfect matchings

Broersma, H. J., Fujisawa, J. & Yoshimoto, K., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1706)

Research output: Book/ReportReportOther research output

Open Access
File
Perfect Matching
Backbone
Colouring
Spanning Subgraph
Vertex Coloring
5 Downloads (Pure)

Backbone colorings for networks: tree and path backbones

Broersma, H. J., Fomin, F. V., Golovach, P. A. & Woeginger, G., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1705)

Research output: Book/ReportReportOther research output

Open Access
File
20 Downloads (Pure)

More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs

Salman, M., Broersma, H. J. & Rodger, C. A., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum; no. 1702)

Research output: Book/ReportReportOther research output

Open Access
File
Grid Graph
Subgraph
Graph in graph theory
Face
Cycle
37 Downloads (Pure)

Path-fan Ramsey numbers

Salman, M. & Broersma, H. J., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum / Department of Applied Mathematics; no. 1703)

Research output: Book/ReportReportOther research output

Open Access
File
Ramsey number
Path
Subgraph
Triangle
Graph in graph theory
7 Downloads (Pure)

Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult

Broersma, H. J., Fomin, F. V., Kratochvil, J. & Woeginger, G., 2003, Enschede: University of Twente, Department of Applied Mathematics. (Memorandum Afdeling TW; no. 1701)

Research output: Book/ReportReportOther research output

Open Access
File
Coloring
Color
Computational complexity
2002

Global connectivity and expansion:long cycles and factors in f-connected graphs (extended version)

Brandt, S., Broersma, H. J., Diestel, R. & Kriesell, M., 2002, Enschede: University of Twente. 21 p. (Hamburger Beiträge zur Mathematik; no. 152)

Research output: Book/ReportReportProfessional

42 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
47 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
33 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
3 Citations (Scopus)
29 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
46 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
72 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
81 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
49 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
41 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
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
35 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
8 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
16 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
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
37 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
25 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

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

51 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
28 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

18 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

On some intriguing problems in Hamiltonian graph theory -- A survey

Broersma, H. J., 1999, Enschede: Universiteit Twente. 26 p.

Research output: Book/ReportReportProfessional

154 Downloads (Pure)
File
26 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

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

96 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
1998

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

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

45 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
45 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
26 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

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

37 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