No photo of Hajo Broersma

Hajo Broersma

prof.dr.ir.

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

Research Output 1987 2018

Filter
Report
2004

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/ReportReport

File

Path-kipas Ramsey numbers

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

Research output: Book/ReportReport

File
2003

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

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

Research output: Book/ReportReport

Open Access
File
Grid Graph
Continuation
Subgraph
Graph in graph theory
Cycle
File
Colouring
Open Problems
Frequency Assignment
Biased
Framework

Backbone colorings along perfect matchings

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

Research output: Book/ReportReport

Open Access
File
Perfect Matching
Backbone
Colouring
Spanning Subgraph
Vertex Coloring

Backbone colorings for networks: tree and path backbones

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

Research output: Book/ReportReport

Open Access
File

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

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

Research output: Book/ReportReport

Open Access
File
Grid Graph
Subgraph
Graph in graph theory
Face
Cycle

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/ReportReport

Open Access
File
Ramsey number
Path
Subgraph
Triangle
Graph in graph theory

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

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

Research output: Book/ReportReport

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: Discrete Mathematics and Mathematical Programming (DMMP). 21 p. (Hamburger Beiträge zur Mathematik; no. 152)

Research output: Book/ReportReport

More about subcolorings

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

Research output: Book/ReportReport

Open Access
File
Vertex Coloring
Clique
Combinatorics
Disjoint
Union

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

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

Research output: Book/ReportReport

Open Access
File
Grid Graph
Subgraph
Graph in graph theory
Cycle
Hamilton Cycle

On stability of the Hamiltonian index under contractions and closures

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

Research output: Book/ReportReport

Open Access
File
3 Citations

Radio labeling with pre-assigned frequencies

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

Research output: Book/ReportReport

Open Access
File
Labeling
Transmitter
Frequency Assignment
Assignment Problem
Pairwise

Spanning 2-connected subgraphs in truncated rectangular grid graphs

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

Research output: Book/ReportReport

File
Grid Graph
Subgraph
Graph in graph theory
Cycle
Hamilton Cycle

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

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

Research output: Book/ReportReport

File

Stars and bunches in planar graphs. Part I: Triangulations

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

Research output: Book/ReportReport

File

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: Department of Applied Mathematics, University of Twente. 19 p. (Memorandum Faculteit TW; no. 1633)

Research output: Book/ReportReport

File

The Ramsey numbers of large cycles versus small wheels

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

Research output: Book/ReportReport

File
Ramsey number
Wheel
Subgraph
Cycle
Graph in graph theory

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

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

Research output: Book/ReportReport

File
Ramsey number
Wheel
Odd
Subgraph
Graph in graph theory
2001

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: Department of Applied Mathematics, University of Twente. 13 p. (Memorandum; no. 1606)

Research output: Book/ReportReport

File
Degree Sum
Line Graph
Path
Graph in graph theory
Circumference

The Hamiltonian index of a graph and its branch-bonds

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

Research output: Book/ReportReport

File

Toughness and hamiltonicity in $k$-trees

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

Research output: Book/ReportReport

File
K-tree
Hamiltonicity
Toughness
Chordal Graphs
Hamiltonian circuit
2000

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

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

Research output: Book/ReportReport

File

A fan type condition for heavy cycles in weighted graphs

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

Research output: Book/ReportReport

File

Directed paths with few or many colors in colored directed graphs

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

Research output: Book/ReportReport

File

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/ReportReport

File

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/ReportReport

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/ReportReport

Forbidden subgraphs that imply Hamiltonian-connectedness

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

Research output: Book/ReportReport

File

On factors of 4-connected claw-free graphs

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

Research output: Book/ReportReport

File

On minimum degree conditions for supereulerian graphs

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

Research output: Book/ReportReport

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/ReportReport

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/ReportReport

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: Department of Applied Mathematics, University of Twente.

Research output: Book/ReportReport

File
1998

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/ReportReport

File

Closure concepts - a survey

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

Research output: Book/ReportReport

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/ReportReport

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/ReportReport

File

Isomorphisms and traversability of directed path graphs

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

Research output: Book/ReportReport

File

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/ReportReport

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/ReportReport

Not every 2-tough graph is Hamiltonian

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

Research output: Book/ReportReport

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/ReportReport

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/ReportReport