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: ProfessionalReport

On Ramsey numbers for paths versus wheels

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

Research output: Other research outputReport

Odd
Graph in graph theory
Ramsey number
Subgraph
Cycle

Path-kipas Ramsey numbers

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

Research output: ProfessionalReport

Graph in graph theory
Ramsey number
Subgraph
Odd
Join
2003
Grid graph
Graph in graph theory
Cycle
Hamilton cycle
Induced subgraph
Colouring
Frequency assignment
Biased
Open problems

Backbone colorings along perfect matchings

Broersma, H. J., Fujisawa, J. & Yoshimoto, K. 2003 Enschede: Department of Applied Mathematics, University of Twente.

Research output: Other research outputReport

Backbone
Colouring
Perfect matching
Graph in graph theory
Spanning subgraph

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.

Research output: Other research outputReport

Backbone
Vertex coloring
Colouring
Spanning subgraph
Spanning tree
Graph in graph theory
Grid graph
Cycle
Hamilton cycle
Induced subgraph

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: Other research outputReport

Graph in graph theory
Ramsey number
Subgraph
Triangle
Join

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.

Research output: Other research outputReport

Planar graph
Colouring
Subgraph
Computational complexity
Graph in graph theory
2002

More about subcolorings

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

Research output: Other research outputReport

Vertex coloring
Clique
Combinatorics
Disjoint
Union
Grid graph
Graph in graph theory
Cycle
Hamilton cycle
Induced subgraph

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.

Research output: Other research outputReport

Graph in graph theory
Claw-free
Line graph
Subgraph
Contraction
3 Citations

Radio labeling with pre-assigned frequencies

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

Research output: Other research outputReport

Labeling
Transmitter
Frequency assignment
Assignment problem
Pairwise

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.

Research output: Other research outputReport

Grid graph
Graph in graph theory
Cycle
Hamilton cycle
Induced subgraph
Graph in graph theory
Grid graph
Cycle
Hamilton cycle
Induced subgraph

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: ProfessionalReport

Star
Path
Plane graph
Triangulation
Consecutive

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: ProfessionalReport

Plane graph
Star
Path
Consecutive
Graph in graph theory

The Ramsey numbers of large cycles versus small wheels

Surahmat, . U., Baskoro, E. T. & Broersma, H. J. 2002 Enschede: Department of Applied Mathematics, University of Twente.

Research output: Other research outputReport

Ramsey number
Subgraph
Graph in graph theory
Wheel
Open problems

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

Surahmat, . U., Baskoro, E. T. & Broersma, H. J. 2002 Enschede: Department of Applied Mathematics, University of Twente.

Research output: Other research outputReport

Ramsey number
Subgraph
Odd
Graph in graph theory
Wheel
2001
Graph in graph theory
Circumference
Line graph
Connected graph
Isomorphic

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: ProfessionalReport

Lower bound
Upper bound
Line graph
Discrete mathematics
Finite graph

Toughness and hamiltonicity in $k$-trees

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

Research output: Other research outputReport

Toughness
K-tree
Chordal graphs
Hamiltonicity
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: ProfessionalReport

Weighted graph
Connected graph
Cycle
Vertex of a graph
Theorem

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: ProfessionalReport

Weighted graph
Cycle
Graph in graph theory
Vertex of a graph
Hamilton cycle

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: ProfessionalReport

Colouring
Vertex of a graph
Polynomial time
Arc of a curve
NP-complete problem

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: ProfessionalReport

Graph in graph theory
Toughness
Continue
Cycle

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: ProfessionalReport

Closure
Claw-free graphs
Circumference
Strengthening
Complete graph
1999

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: Other research outputReport

Hamiltonian connected
Connected graph
Triangle
Path
Claw-free

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: ProfessionalReport

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: ProfessionalReport

Connected graph
Claw-free graphs
Spanning subgraph
Graph in graph theory
Vertex degree

On minimum degree conditions for supereulerian graphs

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

Research output: ProfessionalReport

Graph in graph theory
Connected graph
Minimum degree
Strengthening
Imply
Hamiltonian graph
Claw-free graphs
Regular graph
Graph theory
Open problems

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: ProfessionalReport

Graph in graph theory
Theorem
Hamiltonian graph
Graph theory
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. & Westhuis, J. H. 1999 Enschede: Department of Applied Mathematics, University of Twente.

Research output: Other research outputReport

Modems
Throughput
Asymmetric digital subscriber lines (ADSL)
Random errors
Data communication systems

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: ProfessionalReport

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: ProfessionalReport

Partition
Regular graph
Planar graph
Vertex of a graph
Dual graph

Closure concepts - a survey

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

Research output: ProfessionalReport

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: ProfessionalReport

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: ProfessionalReport

Weighted graph
Graph in graph theory
Long cycle
Longest path
Non-negative

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: ProfessionalReport

Path
Digraph
Graph in graph theory
Line digraph
Isomorphism

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: ProfessionalReport

Cycle
Clique number
Toughness
Local structure
Maximum degree
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: ProfessionalReport

Not every 2-tough graph is Hamiltonian

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

Research output: ProfessionalReport

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: ProfessionalReport

Spanning subgraph
Toughness
Graph in graph theory
Degree condition
Number of components
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: ProfessionalReport

17 Citations

Directed path graphs

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

Research output: ProfessionalReport

Path
Graph in graph theory
Line digraph
Digraph
Isomorphism