Research Output per year
Research Output 1987 2019
- 50 - 100 out of 145 results
- Publication Year, Title (descending)
2008
Connected even factors in claw-free graphs
Li, M. C., Xiong, L. & Broersma, H. J., Jun 2008, In : Discrete mathematics. 308, WoTUG-31/11, p. 2282-2284 3 p., 10.1016/j.disc.2007.04.058.Research output: Contribution to journal › Article › Academic › peer-review
Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks
Broersma, H. J., Fijavz, G., Kaiser, T., Kuzel, R., Ryjacek, Z. & Vrana, P., Dec 2008, In : Discrete mathematics. 308, WoTUG-31/24, p. 6064-6077 14 p., 10.1016/j.disc.2007.11.026.Research output: Contribution to journal › Article › Academic › peer-review
Some families of integral graphs
Wang, L., Broersma, H. J., Hoede, C., Li, X., Li, X. & Still, G. J., Dec 2008, In : Discrete mathematics. 308, WoTUG-31/24, p. 6383-6391 9 p., 10.1016/j.disc.2007.12.010.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Integral Graphs
Number theory
Polynomials
Graph in graph theory
K-tree
The computational complexity of the parallel knock-out problem
Broersma, H. J., Johnson, M., Paulusma, D. & Stewart, I. A., Mar 2008, In : Theoretical computer science. 393, 1-3, p. 182-195 14 p., 10.1016/j.tcs.2007.11.021.Research output: Contribution to journal › Article › Academic › peer-review
2007
Backbone colorings for graphs: Tree and path backbones
Broersma, H. J., Fomin, F. V., Golovach, P. A. & Woeginger, G., Jan 2007, In : Journal of graph theory. 55, SINTEF A13/2, p. 137-152 16 p., 10.1002/jgt.20228.Research output: Contribution to journal › Article › Academic › peer-review
Contractible subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for snarks
Broersma, H. J., Fijavz, G., Kaiser, T., Kuzel, R., Ryjacek, Z. & Vrana, P., 1 Mar 2007, In : Electronic notes in discrete mathematics. 28, 4542, p. 55-59 5 p., 10.1016/j.endm.2007.01.009.Research output: Contribution to journal › Article › Academic › peer-review
Eliminating graphs by means of parallel knock-out schemes
Broersma, H. J., Fomin, F. V., Královič, R. & Woeginger, G., Jan 2007, In : Discrete applied mathematics. 155, 1/2, p. 92-102 11 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Hamiltonians
Dynamic programming
Polynomials
Graph in graph theory
Claw-free Graphs
Integral trees of diameter 6
Wang, L., Broersma, H. J., Hoede, C., Li, X., Li, X. & Still, G. J., 15 May 2007, In : Discrete applied mathematics. 155, 4542/10, p. 1254-1266 13 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Number theory
Polynomials
Diophantine equation
Characteristic polynomial
Adjacency Matrix
On Ramsey numbers for paths versus wheels
Salman, M. & Broersma, H. J., 6 Apr 2007, In : Discrete mathematics. 307, D-07-01/7-8, p. 975-982 8 p., 10.1016/j.disc.2005.11.049.Research output: Contribution to journal › Article › Academic › peer-review
On the complexity of dominating set problems related to the minimum all-ones problem
Broersma, H. J., Li, X. & Li, X., Oct 2007, In : Theoretical computer science. 385, 1/1-3, p. 60-70 11 p., 10.1016/j.tcs.2007.05.027.Research output: Contribution to journal › Article › Academic › peer-review
Path-kipas Ramsey numbers
Salman, M. & Broersma, H. J., 1 Sep 2007, In : Discrete applied mathematics. 155, LNCS4549/14, p. 1878-1884 7 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Ramsey number
Path
Subgraph
Graph in graph theory
Odd
Toughness and hamiltonicity in k-trees
Broersma, H. J., Xiong, L. & Yoshimoto, K., 6 Apr 2007, In : Discrete mathematics. 307, 1/7-8, p. 832-838 7 p., 10.1016/j.disc.2005.11.051.Research output: Contribution to journal › Article › Academic › peer-review
Tutte sets in graphs I: Maximal tutte sets and D-graphs
Bauer, D., Broersma, H. J., Morgana, A. & Schmeichel, E., Mar 2007, In : Journal of graph theory. 55, SINTEF A13/4, p. 343-358 16 p., 10.1002/jgt.20243.Research output: Contribution to journal › Article › Academic › peer-review
Tutte sets in graphs II: The complexity of finding maximum Tutte sets
Bauer, D., Broersma, H. J., Kahl, N., Morgana, A., Schmeichel, E. & Surowiec, T., 15 May 2007, In : Discrete applied mathematics. 155, 4542/10, p. 1336-1343 8 p., 10.1016/j.dam.2007.02.002.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Polynomials
Graph in graph theory
Maximum Matching
Algorithmic Complexity
Polynomial Algorithm
2006
A new upper bound on the cyclic chromatic number
Borodin, O. V., Broersma, H. J., Glebov, A. & van den Heuvel, J., 2006, In : Journal of graph theory. 54, suppl 2/1, p. 58-72 15 p., 10.1002/jgt.20193.Research output: Contribution to journal › Article › Academic › peer-review
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs
Brandt, S., Broersma, H. J., Diestel, R., Kriesell, M. & Kriesell, M., Feb 2006, In : Combinatorica. 26, 06EX1521/1, p. 17-36 20 p.Research output: Contribution to journal › Article › Academic › peer-review
Long Cycle
Connected graph
Connectivity
Vertex Connectivity
Hamiltonicity
Path-fan Ramsey numbers
Salman, M. & Broersma, H. J., Feb 2006, In : Discrete applied mathematics. 154, 06EX1521/9, p. 1429-1436 8 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Ramsey number
Fans
Path
Subgraph
Triangle
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult
Broersma, H. J., Fomin, F. V., Kratochvil, J. & Woeginger, G., May 2006, In : Algorithmica. 44, 4, p. 343-361 19 p., 10.1007/s00453-005-1176-8.Research output: Contribution to journal › Article › Academic › peer-review
Subpancyclicity of line graphs and degree sums along paths
Xiong, L. & Broersma, H. J., 2 Jun 2006, In : Discrete applied mathematics. 154, 06EX1521/9, p. 1453-1463 11 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Degree Sum
Hamiltonians
Line Graph
Path
Graph in graph theory
Toughness in graphs - A survey
Bauer, D., Broersma, H. J. & Schmeichel, E., Apr 2006, In : Graphs and combinatorics. 22, 10/1, p. 1-35 35 p., 10.1007/s00373-006-0649-0.Research output: Contribution to journal › Article › Academic › peer-review
2005
17
Downloads
(Pure)
Handelsreizigers in wiskunde : promotionele activiteiten op de Universiteit Twente
Broersma, H. J. & Ruizenaar, H. W. A., 2005, In : Nieuw archief voor wiskunde. Ser. 5, vol. 6, 2, p. 153-155Research output: Contribution to journal › Article › Academic
File
More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs
Salman, M., Broersma, H. J. & Rodger, C. A., 2005, In : Bulletin of the Institute of Combinatorics and its Applications. 45, p. 17-32 15 p.Research output: Contribution to journal › Article › Academic › peer-review
3
Citations
(Scopus)
On stability of the Hamiltonian index under contractions and closures
Broersma, H. J., Xiong, L. & Ryjácek, Z., 2005, In : Journal of graph theory. 49, p. 104-115 11 p.Research output: Contribution to journal › Article › Academic › peer-review
56
Citations
(Scopus)
37
Downloads
(Pure)
Paths and cycles in colored graphs
Broersma, H. J., Li, X., Li, X., Woeginger, G. & Zhang, S., 2005, In : Australasian journal of combinatorics. 31, 1, p. 299-311 12 p.Research output: Contribution to journal › Article › Academic › peer-review
File
28
Downloads
(Pure)
The Ramsey number of fans versus K4
Surahmat, Baskoro, E. T. & Broersma, H. J., 2005, In : Bulletin of the Institute of Combinatorics and its Applications. 43, p. 96-102 6 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
2004
A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs,
Salman, M., Broersma, H. J. & Rodger, C. A., 2004, In : Journal of combinatorial mathematics and combinatorial computing (JCMCC). 49, p. 177-186 9 p.Research output: Contribution to journal › Article › Academic › peer-review
2
Citations
(Scopus)
Radio Labeling with Preassigned Frequencies
Bodlaender, H. L., Broersma, H. J., Fomin, F. V. & Woeginger, G., 2004, In : SIAM journal on optimization. 15, p. 1-16 16 p.Research output: Contribution to journal › Article › Academic › peer-review
The hamiltonian index of a graph and its branch-bonds
Xiong, L., Broersma, H. J., Li, X., Li, X. & Li, M., 2004, In : Discrete mathematics. 285, 1-3, p. 279-288 9 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Hamiltonians
Branch
Graph in graph theory
Lower bound
Upper bound
4
Downloads
(Pure)
The Ramsey numbers of large cycles versus small wheels
Surahmat, Baskoro, E. T. & Broersma, H. J., 2004, In : Integers. 4, 9 p., A10.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Ramsey number
Wheel
Subgraph
Cycle
Graph in graph theory
2003
More on spanning 2-connected subgraphs in truncated rectangular grid graphs
Salman, M., Baskoro, E. T., Broersma, H. J. & Rodger, C. A., 2003, In : Bulletin of the Institute of Combinatorics and its Applications. 39, p. 31-38 8 p.Research output: Contribution to journal › Article › Academic › peer-review
2002
A fan type condition for heavy cycles in weighted graphs
Zhang, S., Broersma, H. J., Li, X. & Wang, L., 2002, In : Graphs and combinatorics. 18, 1, p. 193-200 8 p.Research output: Contribution to journal › Article › Academic › peer-review
Weighted Graph
Fans
Cycle
Hamilton Cycle
Long Cycle
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems
Broersma, H. J., Kloks, A. J. J., Kloks, T., Kratsch, D. & Müller, H., 2002, In : Algorithmica. 32, 4, p. 594-610 17 p.Research output: Contribution to journal › Article › Academic › peer-review
Triangulation
Graph in graph theory
Cardinality
Set theory
Separators
A note on minimum degree conditions for supereulerian graphs
Broersma, H. J. & Xiong, L., 2002, In : Discrete applied mathematics. 120, 1-3, p. 35-43 9 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Degree Condition
Minimum Degree
Graph in graph theory
Connected graph
Strengthening
Degree sums and subpancyclicity in line graphs
Xiong, L., Broersma, H. J., Hoede, C., Li, X. & Li, X., 2002, In : Discrete mathematics. 242, 1-3, p. 255-267 13 p.Research output: Contribution to journal › Article › Academic › peer-review
Open Access
File
Degree Sum
Line Graph
Exceed
Graph in graph theory
Path
Forbidden subgraphs that imply hamiltonian-connectedness
Broersma, H. J., Faudree, R. J., Huck, A., Trommel, H. & Veldman, H. J., 2002, In : Journal of graph theory. 40, 2, p. 104-119 16 p.Research output: Contribution to journal › Article › Academic › peer-review
Forbidden Subgraph
Claw-free Graphs
Connectedness
Imply
Triangle
Heavy cycles in weighted graphs
Bondy, J. A., Broersma, H. J., van den Heuvel, J. & Veldman, H. J., 2002, In : Discussiones mathematicae. Graph theory. 22, 1, p. 7-15Research output: Contribution to journal › Article › Academic
Open Access
File
Weighted Graph
Cycle
Hamilton Cycle
Paul Adrien Maurice Dirac
Weighting
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 journal › Article › Academic › peer-review
File
Hamiltonians
Isomorphism
Path
Digraph
Graph in graph theory
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 journal › Article › Academic › peer-review
Coloring
Permutation Graphs
Polynomials
Color
Planar graph
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 journal › Article › Academic › peer-review
Open Access
File
Hamiltonian Graph
Hamiltonians
Claw-free Graphs
Graph theory
Regular Graph
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 journal › Article › Academic › peer-review
Open Access
File
Hamiltonians
Polynomial Algorithm
NP-complete problem
Polynomials
Imply
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 journal › Article › Academic › peer-review
Open Access
File
Digraph
Toughness
Cycle
Clique number
Local Structure
2001
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 journal › Article › Academic › peer-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 journal › Article › Academic › peer-review
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 journal › Article › Academic › peer-review
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 journal › Article › Academic › peer-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 journal › Article › Academic › peer-review
Combinatorial optimization
Combinatorial Optimization
Graph in graph theory
Computer science
Discrete mathematics
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 journal › Article › Academic › peer-review
Open Access
File
Claw-free Graphs
Strengthening
Closure
Circumference
Complete Graph
2000
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 journal › Article › Academic › peer-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 journal › Article › Academic › peer-review
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 journal › Article › Academic › peer-review
Approximation algorithms
Electric power distribution
Computational complexity
Polynomials
Water