×
Compute Distance To:
Author ID: broersma.hajo-j Recent zbMATH articles by "Broersma, Hajo J."
Published as: Broersma, Hajo; Broersma, H. J.; Broersma, Hajo J.; Broersma, H.
Further Spellings: Broersma, Haitze Jouke
Homepage: https://research.utwente.nl/en/persons/hajo-broersma
External Links: MGP · ORCID · Google Scholar · Math-Net.Ru · dblp
all top 5

Co-Authors

8 single-authored
25 Paulusma, Daniël
22 Veldman, Henk Jan
20 Zhang, Shenggui
17 Li, Xueliang
16 van den Heuvel, Jan
15 Bauer, Douglas
14 Fomin, Fedor V.
14 Woeginger, Gerhard Johannes
13 Wang, Ligong
12 Golovach, Petr A.
12 Salman, A. N. M.
10 Ryjáček, Zdeněk
9 Johnson, Matthew
9 Li, Binlong
9 Zhang, Yanbo
8 Kloks, Ton
8 Kratsch, Dieter
8 Schmeichel, Edward F.
8 Xiong, Liming
7 Chen, Yaojun
6 Baskoro, Edy Tri
6 Hoede, Cornelis
6 Müller, Haiko
6 Schiermeyer, Ingo
6 Zhang, Xiaoyan
5 Faigle, Ulrich
5 Hurink, Johann L.
5 Li, Fengwei
5 Li, Mingchu
5 Patel, Viresh
5 Pyatkin, Artëm Valer’evich
5 Szeider, Stefan
4 Dantchev, Stefan Stoyanov
4 Kahl, Nathan
4 Kaiser, Tomáš
4 Li, Ruonan
4 Song, Jian
4 Surahmat
4 Tuinstra, Hilde
4 Yoshimoto, Kiyoshi
4 Zheng, Wei
3 Böhme, Thomas
3 Borodin, Oleg Veniaminovich
3 Glebov, Alekseĭ Nikolaevich
3 Huck, Andreas
3 Lu, Yong
3 Morgana, Aurora
3 Pickl, Stefan Wolfgang
3 Rodger, Christopher Andrew
3 Trommel, Huib
3 Vrána, Petr
3 Zhang, Zanbo
3 Zhou, Qiannan
2 Bodlaender, Hans L.
2 Bonsma, Paul S.
2 Boode, Antoon H.
2 Capponi, Agostino
2 Chen, Xiaodong
2 Dahlhaus, Elias
2 Faudree, Ralph Jasper jun.
2 Fiala, Jiří
2 Fijavž, Gašper
2 Guo, Zhiwei
2 Hou, Jiangyou
2 Hu, Dan
2 Jung, Heinz Adolf
2 Koppius, Otto R.
2 Kratochvíl, Jan
2 Kriesell, Matthias
2 Kužel, Roman
2 Li, Xihe
2 Marchal, Bert
2 Nešetřil, Jaroslav
2 Proskurowski, Andrzej
2 Stepney, Susan
2 Stewart, Iain A.
2 Still, Georg J.
2 van ’t Hof, Pim
2 Wu, Jichang
2 Ye, Qingfang
2 Ye, Ruixuan
1 Ainouche, Ahmed
1 Asratian, Armen S.
1 Bielak, Halina
1 Bondy, J. Adrian
1 Brandt, Stephan
1 Broenink, Jan F.
1 Dai, Guowei
1 Diestel, Reinhard
1 Dini, Paolo
1 Dong, Yanni
1 Duijvestijn, A. J. W.
1 Engbers, Erik A.
1 Erlebach, Thomas
1 Friedetzky, Tom
1 Fujisawa, Jun
1 Holub, Premek
1 Jackson, Bill
1 Jagers, A. A.
1 Jiang, He
...and 40 more Co-Authors
all top 5

Serials

33 Discrete Mathematics
25 Journal of Graph Theory
19 Discrete Applied Mathematics
16 Graphs and Combinatorics
9 Discussiones Mathematicae. Graph Theory
8 Ars Combinatoria
7 Theoretical Computer Science
4 Networks
4 Journal of Discrete Algorithms
4 Electronic Journal of Graph Theory and Applications
3 Applied Mathematics and Computation
3 Algorithmica
3 SIAM Journal on Discrete Mathematics
3 Bulletin of the Institute of Combinatorics and its Applications
3 The Electronic Journal of Combinatorics
3 Texts in Algorithmics
2 European Journal of Combinatorics
2 JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
2 Linear Algebra and its Applications
2 Tatra Mountains Mathematical Publications
2 Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1
2 Electronic Notes in Discrete Mathematics
1 Bulletin of the Australian Mathematical Society
1 Computing
1 Journal of Combinatorial Theory. Series B
1 Combinatorica
1 Applied Mathematics Letters
1 SIAM Journal on Optimization
1 The Australasian Journal of Combinatorics
1 Journal of Mathematical Chemistry
1 Journal of Automata, Languages and Combinatorics
1 Mathematical Methods of Operations Research
1 Journal of Combinatorial Optimization
1 Discrete Mathematics and Theoretical Computer Science. DMTCS
1 Bulletin of the European Association for Theoretical Computer Science EATCS
1 Integers
1 MATCH - Communications in Mathematical and in Computer Chemistry
1 Lecture Notes in Computer Science
1 Journal of Combinatorics

Publications by Year

Citations contained in zbMATH Open

161 Publications have been cited 1,210 times in 857 Documents Cited by Year
Toughness in graphs – a survey. Zbl 1088.05045
Bauer, Douglas; Broersma, Hajo; Schmeichel, Edward
44
2006
Not every 2-tough graph is Hamiltonian. Zbl 0934.05083
Bauer, D.; Broersma, H. J.; Veldman, H. J.
41
2000
Updating the complexity status of coloring graphs without a fixed induced linear forest. Zbl 1234.68129
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian
34
2012
Paths and cycles in colored graphs. Zbl 1061.05030
Broersma, Hajo; Li, Xueliang; Woeginger, Gerhard; Zhang, Shenggui
33
2005
Independent sets in asteroidal triple-free graphs. Zbl 0918.68072
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
31
1999
Spanning trees with many or few colors in edge-colored graphs. Zbl 0923.05018
Broersma, Hajo; Li, Xueliang
30
1997
Independence trees and Hamilton cycles. Zbl 0919.05017
Broersma, Hajo; Tuinstra, Hilde
30
1998
On factors of 4-connected claw-free graphs. Zbl 0984.05067
Broersma, H. J.; Kriesell, M.; Ryjáček, Z.
23
2001
Path graphs. Zbl 0677.05068
Broersma, H. J.; Hoede, C.
23
1989
A generalization of a result of Häggkvist and Nicoghossian. Zbl 0634.05053
Bauer, Douglas; Broersma, H. J.; Veldman, H. J.; Rao, Li
21
1989
Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
21
2013
Minimal degrees and chromatic numbers of squares of planar graphs. Zbl 1012.05074
Borodin, O. V.; Broersma, H.; Glebov, A. N.; van den Heuvel, Jan
19
2001
Backbone colorings for graphs: tree and path backbones. Zbl 1118.05031
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J.
19
2007
Cycles through subsets with large degree sums. Zbl 0883.05089
Broersma, Hajo; Li, Hao; Li, Jianping; Tian, Feng; Veldman, Henk Jan
19
1997
Complexity of conditional colorability of graphs. Zbl 1188.05064
Li, Xueliang; Yao, Xiangmei; Zhou, Wenli; Broersma, Hajo
19
2009
Dirac’s minimum degree condition restricted to claws. Zbl 0880.05062
Broersma, H. J.; Ryjáček, Z.; Schiermeyer, I.
18
1997
Best monotone degree conditions for graph properties: a survey. Zbl 1306.05032
Bauer, D.; Broersma, H. J.; Den Heuvel, J.van; Kahl, N.; Nevo, A.; Schmeichel, E.; Woodall, D. R.; Yatauro, M.
18
2015
3-connected line graphs of triangular graphs are panconnected and 1- Hamiltonian. Zbl 0656.05045
Broersma, H. J.; Veldman, H. J.
17
1987
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Zbl 0940.05064
Broersma, H. J.; Dahlhaus, E.; Kloks, T.
17
2000
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time. Zbl 1241.05030
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian
17
2012
On star-critical and upper size Ramsey numbers. Zbl 1330.05157
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun
17
2016
A generalization of Ore’s Theorem involving neighborhood unions. Zbl 0789.05058
Broersma, H. J.; van den Heuvel, J.; Veldman, H. J.
16
1993
The Hamiltonian index of a graph and its branch-bonds. Zbl 1044.05049
Xiong, Liming; Broersma, H. J.; Li, Xueliang; Li, Mingchu
15
2004
\(\lambda \)-backbone colorings along pairwise disjoint stars and matchings. Zbl 1213.05068
Broersma, H. J.; Fujisawa, J.; Marchal, L.; Paulusma, D.; Salman, A. N. M.; Yoshimoto, K.
15
2009
Closure concepts: A survey. Zbl 0946.05051
Broersma, Hajo; Ryjáček, Zdeněk; Schiermeyer, Ingo
15
2000
Heavy cycles in weighted graphs. Zbl 1012.05104
Bondy, J. Adrian; Broersma, Hajo J.; van den Heuvel, Jan; Veldman, Henk Jan
13
2002
Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of \(K_{1,3}\)-free graphs. Zbl 0723.05082
Broersma, Hajo; Veldman, Henk Jan
13
1990
The structure of the planar triangulations in terms of bundles and stars. Zbl 0977.05036
Borodin, O. V.; Broersma, H.; Glebov, A. N.; van den Heuvel, J.
13
2001
Forbidden subgraphs that imply Hamiltonian-connectedness. Zbl 0999.05067
Broersma, Hajo; Faudree, Ralph J.; Huck, Andreas; Trommel, Huib; Veldman, Henk Jan
12
2002
A note on minimum degree conditions for supereulerian graphs. Zbl 0993.05097
Broersma, H. J.; Xiong, Liming
12
2002
On some intriguing problems in Hamiltonian graph theory—a survey. Zbl 0998.05040
Broersma, H. J.
12
2002
Long cycles in graphs with prescribed toughness and minimum degree. Zbl 0831.05039
Bauer, Douglas; Broersma, H. J.; van den Heuvel, J.; Veldman, H. J.
12
1995
On toughness and Hamiltonicity of \(2K_{2}\)-free graphs. Zbl 1292.05162
Broersma, Hajo; Patel, Viresh; Pyatkin, Artem
12
2014
Existence of \(\Delta _{\lambda}\)-cycles and \(\Delta _{\lambda}\)- paths. Zbl 0662.05038
Broersma, H. J.
11
1988
Three complexity results on coloring \(P _{k }\)-free graphs. Zbl 1267.05113
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
11
2009
Toughness and hamiltonicity in almost claw-free graphs. Zbl 0847.05069
Broersma, H. J.; Ryjáček, Z.; Schiermeyer, I.
11
1996
Path-fan Ramsey numbers. Zbl 1093.05043
Salman, A. N. M.; Broersma, H. J.
11
2006
How many conjectures can you stand? A survey. Zbl 1234.05146
Broersma, H. J.; Ryjáček, Z.; Vrána, P.
11
2012
Heavy paths and cycles in weighted graphs. Zbl 0967.05040
Zhang, Shenggui; Li, Xueliang; Broersma, Hajo
10
2000
The Ramsey numbers of large cycles versus small wheels. Zbl 1061.05063
Surahmat; Baskoro, E. T.; Broersma, H. J.
10
2004
Remarks on Hamiltonian properties of claw-free graphs. Zbl 0715.05048
Ainouche, A.; Broersma, H. J.; Veldman, H. J.
10
1990
Generating all 3-connected 4-regular planar graphs from the Octahedron Graph. Zbl 0781.05047
Broersma, H. J.; Duijvestijn, A. J. W.; Göbel, F.
10
1993
Cycles through particular subgraphs of claw-free graphs. Zbl 0835.05042
Broersma, H. J.; Lu, M.
10
1995
More about subcolorings. Zbl 1239.05060
Broersma, Hajo; Fomin, Fedor V.; Nešetřil, Jaroslav; Woeginger, Gerhard J.
10
2002
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080
Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej
10
2015
On hamiltonian properties of 2-tough graphs. Zbl 0815.05042
Bauer, D.; Broersma, H. J.; van den Heuvel, J.; Veldman, H. J.
9
1994
Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Zbl 1095.68075
Broersma, Hajo; Fomin, Fedor V.; Kratochvil, Jan; Woeginger, Gerhard J.
9
2006
Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs. Zbl 1112.05059
Brandt, Stephan; Broersma, Hajo; Diestel, Reinhard; Kriesell, Matthias
9
2006
Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Zbl 1157.05041
Broersma, Hajo; Fijavž, Gašper; Kaiser, Tomáš; Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr
9
2008
Strengthening the closure concept in claw-free graphs. Zbl 0981.05067
Broersma, Hajo; Ryjáček, Zdeněk
8
2001
Backbone colorings for networks. Zbl 1255.05076
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J.
8
2003
Toughness and Hamiltonicity in \(k\)-trees. Zbl 1117.05069
Broersma, Hajo; Xiong, Liming; Yoshimoto, Kiyoshi
8
2007
A new algorithm for on-line coloring bipartite graphs. Zbl 1181.05035
Broersma, Hajo J.; Capponi, Agostino; Paulusma, Daniël
8
2008
The connectivity of the leaf-exchange spanning tree graph of a graph. Zbl 0881.05076
Broersma, H. J.; Xueliang, L.
7
1996
Subgraph conditions for dominating circuits in graphs and pancyclicity of line graphs. Zbl 0641.05036
Broersma, H. J.
7
1987
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Zbl 1181.05036
Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M.
7
2009
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Zbl 1210.05064
Broersma, Hajo; Paulusma, Daniël; Yoshimoto, Kiyoshi
7
2009
A general framework for coloring problems: Old results, new results, and open problems. Zbl 1117.05038
Broersma, Hajo
7
2005
Properly edge-colored theta graphs in edge-colored complete graphs. Zbl 1407.05097
Li, Ruonan; Broersma, Hajo; Zhang, Shenggui
7
2019
A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs. Zbl 1312.68234
Wang, Limin; Zhang, Xiaoyan; Zhang, Zhao; Broersma, Hajo
7
2015
Forbidden subgraphs for Hamiltonicity of 1-tough graphs. Zbl 1350.05088
Li, Binlong; Broersma, Hajo J.; Zhang, Shenggui
7
2016
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. Zbl 1009.68099
Broersma, H. J.; Kloks, T.; Kratsch, D.; Müller, H.
6
2002
Around three lemmas in Hamiltonian graph theory. Zbl 0736.05054
Bauer, D.; Broersma, H. J.; Veldman, H. J.
6
1990
A note on \(K_ 4\)-closures in hamiltonian graph theory. Zbl 0789.05057
Broersma, H. J.
6
1993
Spanning trees with pairwise nonadjacent endvertices. Zbl 0876.05020
Böhme, T.; Broersma, H. J.; Göbel, F.; Kostochka, A. V.; Stiebitz, Michael
6
1997
Path-kipas Ramsey numbers. Zbl 1128.05037
Salman, A. N. M.; Broersma, H. J.
6
2007
On Ramsey numbers for paths versus wheels. Zbl 1115.05060
Salman, A. N. M.; Broersma, H. J.
6
2007
Degree-preserving trees. Zbl 0938.90065
Broersma, Hajo; Koppius, Otto; Tuinstra, Hilde; Huck, Andreas; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
6
2000
Hamiltonicity of regular 2-connected graphs. Zbl 0864.05058
Broersma, H. J.; van den Heuvel, J.; Jackson, B.; Veldman, H. J.
6
1996
The Ramsey numbers of fans versus \(K_4\). Zbl 1067.05049
Surahmat; Baskoro, E. T.; Broersma, H. J.
6
2005
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Zbl 1297.05163
Broersma, Hajo; Golovach, Petr A.; Patel, Viresh
6
2013
A remark on star-\(C_4\) and wheel-\(C_4\) Ramsey numbers. Zbl 1306.05152
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun
6
2014
Closure concepts for claw-free graphs. Zbl 0955.05087
Broersma, H. J.; Trommel, H.
5
1998
A fan type condition for heavy cycles in weighted graphs. Zbl 0994.05090
Zhang, Shenggui; Broersma, Hajo; Li, Xueliang; Wang, Ligong
5
2002
A \(\sigma_3\) type condition for heavy cycles in weighted graphs. Zbl 1002.05047
Zhang, Shenggui; Li, Xueliang; Broersma, Hajo
5
2001
On stability of the Hamiltonian index under contractions and closures. Zbl 1065.05060
Xiong, Liming; Ryjáček, Zdeněk; Broersma, Hajo
5
2005
The connectivity of the basis graph of a branching greedoid. Zbl 0765.05062
Broersma, H. J.; Li, Xueliang
5
1992
Another equivalent of the graceful tree conjecture. Zbl 0977.05114
Broersma, H. J.; Hoede, C.
5
1999
Long dominating cycles and paths in graphs with large neighborhood unions. Zbl 0729.05032
Broersma, H. J.; Veldman, H. J.
5
1991
Degree sequences and the existence of \(k\)-factors. Zbl 1256.05051
Bauer, D.; Broersma, H. J.; van den Heuvel, J.; Kahl, N.; Schmeichel, E.
5
2012
Connected even factors in claw-free graphs. Zbl 1143.05067
Li, Mingchu; Xiong, Liming; Broersma, H. J.
5
2008
An upper bound for the Ramsey number of a cycle of length four versus wheels. Zbl 1117.05077
Surahmat; Baskoro, Edy Tri; Uttunggadewa, Saladin; Broersma, Hajo
5
2005
Toughness and vertex degrees. Zbl 1259.05040
Bauer, D.; Broersma, H. J.; Van den Heuvel, J.; Kahl, N.; Schmeichel, E.
5
2013
Fully decomposable split graphs. Zbl 1257.05125
Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J.
5
2013
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Zbl 1234.05144
Li, Mingchu; Chen, Xiaodong; Broersma, Hajo
5
2011
On generalizing a theorem of Jung. Zbl 0843.05071
Bauer, Douglas; Broersma, H. J.; Veldman, H. J.
5
1995
On graphs satisfying a local Ore-type condition. Zbl 0839.05066
Asratian, A. S.; Broersma, H. J.; van den Heuvel, J.; Veldman, H. J.
5
1996
Independent sets in asteroidal triple-free graphs. Zbl 1401.05278
Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko
5
1997
Removable edges and chords of longest cycles in 3-connected graphs. Zbl 1291.05113
Wu, Jichang; Broersma, Hajo; Kang, Haiyan
5
2014
Spanning 2-connected subgraphs in alphabet graphs, special classes of grid graphs. Zbl 1053.05093
Salman, A. N. M.; Broersma, Hajo; Baskoro, Edy Tri
4
2003
Tutte sets in graphs. I: Maximal Tutte sets and \(D\)-graphs. Zbl 1120.05067
Bauer, D.; Broersma, H. J.; Morgana, A.; Schmeichel, E.
4
2007
Eliminating graphs by means of parallel knock-out schemes. Zbl 1109.05091
Broersma, Hajo; Fomin, Fedor V.; Královič, Rastislav; Woeginger, Gerhard J.
4
2007
On hamiltonicity of \(P_{3}\)-dominated graphs. Zbl 1161.05331
Broersma, H. J.; Vumar, E.
4
2009
Cycle extension in edge-colored complete graphs. Zbl 1369.05080
Li, Ruonan; Broersma, Hajo; Xu, Chuandong; Zhang, Shenggui
4
2017
Exact algorithms for finding longest cycles in claw-free graphs. Zbl 1259.05162
Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël
4
2013
Some families of integral graphs. Zbl 1171.05364
Wang, Ligong; Broersma, Hajo; Hoede, Cornelis; Li, Xueliang; Still, Georg
4
2008
Long paths and cycles in tough graphs. Zbl 0778.05047
Broersma, H. J.; van den Heuvel, J.; Jung, H. A.; Veldman, H. J.
4
1993
How tough is toughness? Zbl 1409.68207
Broersma, Hajo
4
2015
Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion. Zbl 1052.68097
Bauer, D.; Broersma, H. J.; Morgana, A.; Schmeichel, E.
3
2002
Radio labeling with preassigned frequencies. Zbl 1071.05033
Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor V.; Pyatkin, Artem V.; Woeginger, Gerhard J.
3
2004
Almost Eulerian compatible spanning circuits in edge-colored graphs. Zbl 1455.05039
Guo, Zhiwei; Broersma, Hajo; Li, Binlong; Zhang, Shenggui
1
2021
Sharp upper bounds for augmented Zagreb index of graphs with fixed parameters. Zbl 1473.92080
Li, Fengwei; Ye, Qingfang; Broersma, Hajo; Ye, Ruixuan
1
2021
Extremal problems and results related to Gallai-colorings. Zbl 1472.05056
Li, Xihe; Broersma, Hajo; Wang, Ligong
1
2021
On sufficient spectral radius conditions for Hamiltonicity. Zbl 1461.05116
Zhou, Qiannan; Broersma, Hajo; Wang, Ligong; Lu, Yong
1
2021
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs. Zbl 1485.05063
Li, Ruonan; Broersma, Hajo; Zhang, Shenggui
2
2020
Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs. Zbl 1429.05116
Zheng, Wei; Broersma, Hajo; Wang, Ligong; Zhang, Shenggui
1
2020
Spectral properties of inverse sum indeg index of graphs. Zbl 1448.92394
Li, Fengwei; Li, Xueliang; Broersma, Hajo
1
2020
On sufficient degree conditions for traceability of claw-free graphs. Zbl 1440.05163
Tian, Tao; Broersma, Hajo; Xiong, Liming
1
2020
Properly edge-colored theta graphs in edge-colored complete graphs. Zbl 1407.05097
Li, Ruonan; Broersma, Hajo; Zhang, Shenggui
7
2019
Decompositions of graphs based on a new graph product. Zbl 1407.05190
Boode, Antoon H.; Broersma, Hajo
1
2019
A polynomial algorithm for weighted scattering number in interval graphs. Zbl 1414.05276
Li, Fengwei; Zhang, Xiaoyan; Broersma, Hajo
1
2019
Extremal benzenoid systems for two modified versions of the Randić index. Zbl 1427.92102
Li, Fengwei; Broersma, Hajo; Rada, Juan; Sun, Yuefang
2
2018
Conditions for graphs to be path partition optimal. Zbl 1383.05187
Li, Binlong; Broersma, Hajo; Zhang, Shenggui
1
2018
Cycle extension in edge-colored complete graphs. Zbl 1369.05080
Li, Ruonan; Broersma, Hajo; Xu, Chuandong; Zhang, Shenggui
4
2017
Extremal and degree conditions for path extendability in digraphs. Zbl 1370.05083
Zhang, Zan-Bo; Zhang, Xiaoyan; Broersma, Hajo; Lou, Dingjun
2
2017
On star-critical and upper size Ramsey numbers. Zbl 1330.05157
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun
17
2016
Forbidden subgraphs for Hamiltonicity of 1-tough graphs. Zbl 1350.05088
Li, Binlong; Broersma, Hajo J.; Zhang, Shenggui
7
2016
Narrowing down the gap on cycle-star Ramsey numbers. Zbl 1338.05179
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun
2
2016
On fan-wheel and tree-wheel Ramsey numbers. Zbl 1338.05180
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun
1
2016
Hamiltonian properties of almost locally connected claw-free graphs. Zbl 1413.05200
Chen, Xiaodong; Li, MingChu; Liao, Wei; Broersma, Hajo
1
2016
On the complexity of edge-colored subgraph partitioning problems in network optimization. Zbl 1343.05067
Zhang, Xiaoyan; Zhang, Zan-Bo; Broersma, Hajo; Wen, Xuelian
1
2016
Best monotone degree conditions for graph properties: a survey. Zbl 1306.05032
Bauer, D.; Broersma, H. J.; Den Heuvel, J.van; Kahl, N.; Nevo, A.; Schmeichel, E.; Woodall, D. R.; Yatauro, M.
18
2015
Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080
Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej
10
2015
A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs. Zbl 1312.68234
Wang, Limin; Zhang, Xiaoyan; Zhang, Zhao; Broersma, Hajo
7
2015
How tough is toughness? Zbl 1409.68207
Broersma, Hajo
4
2015
Characterizing heavy subgraph pairs for pancyclicity. Zbl 1312.05092
Li, Binlong; Ning, Bo; Broersma, Hajo; Zhang, Shenggui
1
2015
On a directed tree problem motivated by a newly introduced graph product. Zbl 1467.68136
Boode, Antoon H.; Broersma, Hajo; Broenink, Jan F.
1
2015
Ramsey numbers of trees versus fans. Zbl 1371.05177
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun
1
2015
A note on Ramsey numbers for fans. Zbl 1319.05134
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun
1
2015
On toughness and Hamiltonicity of \(2K_{2}\)-free graphs. Zbl 1292.05162
Broersma, Hajo; Patel, Viresh; Pyatkin, Artem
12
2014
A remark on star-\(C_4\) and wheel-\(C_4\) Ramsey numbers. Zbl 1306.05152
Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun
6
2014
Removable edges and chords of longest cycles in 3-connected graphs. Zbl 1291.05113
Wu, Jichang; Broersma, Hajo; Kang, Haiyan
5
2014
Heavy subgraph pairs for traceability of block-chains. Zbl 1290.05099
Li, Binlong; Broersma, Hajo; Zhang, Shenggui
1
2014
Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
21
2013
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Zbl 1297.05163
Broersma, Hajo; Golovach, Petr A.; Patel, Viresh
6
2013
Toughness and vertex degrees. Zbl 1259.05040
Bauer, D.; Broersma, H. J.; Van den Heuvel, J.; Kahl, N.; Schmeichel, E.
5
2013
Fully decomposable split graphs. Zbl 1257.05125
Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J.
5
2013
Exact algorithms for finding longest cycles in claw-free graphs. Zbl 1259.05162
Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël
4
2013
Forbidden subgraph pairs for traceability of block-chains. Zbl 1306.05205
Li, Binlong; Broersma, Hajo; Zhang, Shenggui
3
2013
Updating the complexity status of coloring graphs without a fixed induced linear forest. Zbl 1234.68129
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian
34
2012
Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time. Zbl 1241.05030
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian
17
2012
How many conjectures can you stand? A survey. Zbl 1234.05146
Broersma, H. J.; Ryjáček, Z.; Vrána, P.
11
2012
Degree sequences and the existence of \(k\)-factors. Zbl 1256.05051
Bauer, D.; Broersma, H. J.; van den Heuvel, J.; Kahl, N.; Schmeichel, E.
5
2012
Tight complexity bounds for FPT subgraph problems parameterized by clique-width. Zbl 1352.68095
Broersma, Hajo; Golovach, Petr A.; Patel, Viresh
1
2012
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Zbl 1234.05144
Li, Mingchu; Chen, Xiaodong; Broersma, Hajo
5
2011
The complexity status of problems related to sparsest cuts. Zbl 1326.68145
Bonsma, Paul; Broersma, Hajo; Patel, Viresh; Pyatkin, Artem
2
2011
Fast exact algorithms for Hamiltonicity in claw-free graphs. Zbl 1273.05216
Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël
2
2010
Computing sharp 2-factors in claw-free graphs. Zbl 1231.05210
Broersma, Hajo; Paulusma, Daniël
2
2010
Narrowing down the gap on the complexity of coloring \(P _{k }\)-free graphs. Zbl 1308.68063
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian
1
2010
On coloring graphs without induced forests. Zbl 1310.68100
Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian
1
2010
Complexity of conditional colorability of graphs. Zbl 1188.05064
Li, Xueliang; Yao, Xiangmei; Zhou, Wenli; Broersma, Hajo
19
2009
\(\lambda \)-backbone colorings along pairwise disjoint stars and matchings. Zbl 1213.05068
Broersma, H. J.; Fujisawa, J.; Marchal, L.; Paulusma, D.; Salman, A. N. M.; Yoshimoto, K.
15
2009
Three complexity results on coloring \(P _{k }\)-free graphs. Zbl 1267.05113
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël
11
2009
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Zbl 1181.05036
Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M.
7
2009
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Zbl 1210.05064
Broersma, Hajo; Paulusma, Daniël; Yoshimoto, Kiyoshi
7
2009
On hamiltonicity of \(P_{3}\)-dominated graphs. Zbl 1161.05331
Broersma, H. J.; Vumar, E.
4
2009
Fully decomposable split graphs. Zbl 1267.05245
Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J.
1
2009
Upper bounds and algorithms for parallel knock-out numbers. Zbl 1164.68026
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël
1
2009
Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Zbl 1157.05041
Broersma, Hajo; Fijavž, Gašper; Kaiser, Tomáš; Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr
9
2008
A new algorithm for on-line coloring bipartite graphs. Zbl 1181.05035
Broersma, Hajo J.; Capponi, Agostino; Paulusma, Daniël
8
2008
Connected even factors in claw-free graphs. Zbl 1143.05067
Li, Mingchu; Xiong, Liming; Broersma, H. J.
5
2008
Some families of integral graphs. Zbl 1171.05364
Wang, Ligong; Broersma, Hajo; Hoede, Cornelis; Li, Xueliang; Still, Georg
4
2008
The computational complexity of the parallel knock-out problem. Zbl 1136.68028
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A.
3
2008
The Ramsey numbers of large star and large star-like trees versus odd wheels. Zbl 1172.05044
Surahmat; Baskoro, Edy Tri; Broersma, H. J.
2
2008
Computing sharp 2-factors in claw-free graphs. Zbl 1173.05348
Broersma, Hajo; Paulusma, Daniël
1
2008
Backbone colorings for graphs: tree and path backbones. Zbl 1118.05031
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J.
19
2007
Toughness and Hamiltonicity in \(k\)-trees. Zbl 1117.05069
Broersma, Hajo; Xiong, Liming; Yoshimoto, Kiyoshi
8
2007
Path-kipas Ramsey numbers. Zbl 1128.05037
Salman, A. N. M.; Broersma, H. J.
6
2007
On Ramsey numbers for paths versus wheels. Zbl 1115.05060
Salman, A. N. M.; Broersma, H. J.
6
2007
Tutte sets in graphs. I: Maximal Tutte sets and \(D\)-graphs. Zbl 1120.05067
Bauer, D.; Broersma, H. J.; Morgana, A.; Schmeichel, E.
4
2007
Eliminating graphs by means of parallel knock-out schemes. Zbl 1109.05091
Broersma, Hajo; Fomin, Fedor V.; Královič, Rastislav; Woeginger, Gerhard J.
4
2007
Tutte sets in graphs. II: The complexity of finding maximum Tutte sets. Zbl 1119.05086
Bauer, D.; Broersma, H. J.; Kahl, N.; Morgana, A.; Schmeichel, E.; Surowiec, T.
3
2007
Improved upper bounds for \(\lambda \)-backbone colorings along matchings and stars. Zbl 1131.05301
Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M.
3
2007
A new upper bound on the cyclic chromatic number. Zbl 1109.05042
Borodin, O. V.; Broersma, H. J.; Glebov, A.; van den Heuvel, J.
3
2007
Integral trees of diameter 6. Zbl 1119.05070
Wang, Ligong; Broersma, Hajo; Hoede, Cornelis; Li, Xueliang; Still, Georg
1
2007
On the complexity of dominating set problems related to the minimum all-ones problem. Zbl 1124.68076
Broersma, Hajo; Li, Xueliang
1
2007
Toughness in graphs – a survey. Zbl 1088.05045
Bauer, Douglas; Broersma, Hajo; Schmeichel, Edward
44
2006
Path-fan Ramsey numbers. Zbl 1093.05043
Salman, A. N. M.; Broersma, H. J.
11
2006
Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Zbl 1095.68075
Broersma, Hajo; Fomin, Fedor V.; Kratochvil, Jan; Woeginger, Gerhard J.
9
2006
Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs. Zbl 1112.05059
Brandt, Stephan; Broersma, Hajo; Diestel, Reinhard; Kriesell, Matthias
9
2006
On-line coloring of \(H\)-free bipartite graphs. Zbl 1183.68748
Broersma, H. J.; Capponi, A.; Paulusma, D.
2
2006
The computational complexity of the parallel knock-out problem. Zbl 1145.68433
Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A.
1
2006
Paths and cycles in colored graphs. Zbl 1061.05030
Broersma, Hajo; Li, Xueliang; Woeginger, Gerhard; Zhang, Shenggui
33
2005
A general framework for coloring problems: Old results, new results, and open problems. Zbl 1117.05038
Broersma, Hajo
7
2005
The Ramsey numbers of fans versus \(K_4\). Zbl 1067.05049
Surahmat; Baskoro, E. T.; Broersma, H. J.
6
2005
On stability of the Hamiltonian index under contractions and closures. Zbl 1065.05060
Xiong, Liming; Ryjáček, Zdeněk; Broersma, Hajo
5
2005
An upper bound for the Ramsey number of a cycle of length four versus wheels. Zbl 1117.05077
Surahmat; Baskoro, Edy Tri; Uttunggadewa, Saladin; Broersma, Hajo
5
2005
The Hamiltonian index of a graph and its branch-bonds. Zbl 1044.05049
Xiong, Liming; Broersma, H. J.; Li, Xueliang; Li, Mingchu
15
2004
The Ramsey numbers of large cycles versus small wheels. Zbl 1061.05063
Surahmat; Baskoro, E. T.; Broersma, H. J.
10
2004
Radio labeling with preassigned frequencies. Zbl 1071.05033
Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor V.; Pyatkin, Artem V.; Woeginger, Gerhard J.
3
2004
The Ramsey numbers of paths versus kipases. Zbl 1125.05314
Salman, A. N. M.; Broersma, H. J.
2
2004
Parallel knock-out schemes in networks. Zbl 1096.68118
Broersma, Hajo; Fomin, Fedor V.; Woeginger, Gerhard J.
1
2004
Backbone colorings for networks. Zbl 1255.05076
Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J.
8
2003
Spanning 2-connected subgraphs in alphabet graphs, special classes of grid graphs. Zbl 1053.05093
Salman, A. N. M.; Broersma, Hajo; Baskoro, Edy Tri
4
2003
Heavy cycles in weighted graphs. Zbl 1012.05104
Bondy, J. Adrian; Broersma, Hajo J.; van den Heuvel, Jan; Veldman, Henk Jan
13
2002
Forbidden subgraphs that imply Hamiltonian-connectedness. Zbl 0999.05067
Broersma, Hajo; Faudree, Ralph J.; Huck, Andreas; Trommel, Huib; Veldman, Henk Jan
12
2002
A note on minimum degree conditions for supereulerian graphs. Zbl 0993.05097
Broersma, H. J.; Xiong, Liming
12
2002
On some intriguing problems in Hamiltonian graph theory—a survey. Zbl 0998.05040
Broersma, H. J.
12
2002
More about subcolorings. Zbl 1239.05060
Broersma, Hajo; Fomin, Fedor V.; Nešetřil, Jaroslav; Woeginger, Gerhard J.
10
2002
A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. Zbl 1009.68099
Broersma, H. J.; Kloks, T.; Kratsch, D.; Müller, H.
6
2002
...and 61 more Documents
all top 5

Cited by 1,100 Authors

51 Broersma, Hajo J.
43 Xiong, Liming
36 Paulusma, Daniël
32 Lai, Hong-Jian
22 Ryjáček, Zdeněk
21 Golovach, Petr A.
20 Li, Binlong
20 Ozeki, Kenta
18 Li, Hao
18 Yoshimoto, Kiyoshi
18 Zhang, Shenggui
17 Yamashita, Tomoki
16 Vrána, Petr
14 Tsugaki, Masao
13 Bauer, Douglas
12 Kratsch, Dieter
12 Malyshev, Dmitriĭ Sergeevich
11 Borodin, Oleg Veniaminovich
11 Ivanova, Anna Olegovna
10 Chen, Yaojun
10 Fujisawa, Jun
10 Li, Xueliang
10 Li, Yusheng
10 Ning, Bo
10 Schmeichel, Edward F.
10 Veldman, Henk Jan
10 Zhan, Mingquan
9 Chiba, Shuya
9 Wang, Ye
9 Wei, Bing
8 Čada, Roman
8 Chen, Guantao
8 Gould, Ronald J.
8 Li, Mingchu
8 Li, Yan
8 Liu, Guizhen
8 Shan, Songling
8 Song, Jian
8 Tian, Feng
8 van den Heuvel, Jan
8 Wang, Ligong
7 Brandstädt, Andreas
7 Bu, Yuehua
7 Cai, Junqing
7 Cheng, Tai-Chiu Edwin
7 Saito, Akira
6 Dabrowski, Konrad Kazimierz
6 Faudree, Ralph Jasper jun.
6 Feng, Lihua
6 Johnson, Matthew
6 Kaiser, Tomáš
6 Kano, Mikio
6 Monnot, Jérôme
6 Schiermeyer, Ingo
6 Sudakov, Benny
6 Van Leeuwen, Erik Jan
6 Venkatachalam, Mathiyazhagan
6 Zhou, Sanming
5 Ainouche, Ahmed
5 Asratian, Armen S.
5 Balbuena, Camino
5 Cerulli, Raffaele
5 Flandrin, Evelyne
5 Fomin, Fedor V.
5 Furuya, Michitaka
5 García-Vázquez, Pedro
5 Gentili, Monica
5 Havet, Frédéric
5 Katona, Gyula Y.
5 Liu, Weijun
5 Lozin, Vadim Vladislavovich
5 Martin, Barnaby D.
5 Mathew Karakkad, Sunil
5 Matsuda, Haruhide
5 Müller, Haiko
5 Nevo, Aori
5 Orlovich, Yuriĭ Leonidovich
5 Ota, Katsuhiro
5 Rivera-Campo, Eduardo
5 Salman, A. N. M.
5 Smith, Siani
5 Turowski, Krzysztof
5 Vumar, Elkin
5 Wu, Baoyindureng
5 Zhang, Xiaoyan
5 Zhang, Zhao
4 Bagheri, Alireza
4 Baskoro, Edy Tri
4 Bielak, Halina
4 Brause, Christoph
4 Chen, Bing
4 Chen, Xiaodong
4 Chen, Xiaozheng
4 Cioabă, Sebastian M.
4 Fujita, Shinya
4 Golumbic, Martin Charles
4 Gordon, Valery S.
4 Harant, Jochen
4 Heggernes, Pinar
4 Hu, Zhiquan
...and 1,000 more Authors
all top 5

Cited in 116 Serials

191 Discrete Mathematics
123 Discrete Applied Mathematics
97 Graphs and Combinatorics
36 Theoretical Computer Science
25 Discussiones Mathematicae. Graph Theory
24 Journal of Graph Theory
20 Information Processing Letters
17 Journal of Combinatorial Theory. Series B
14 Algorithmica
14 Journal of Combinatorial Optimization
13 European Journal of Combinatorics
12 The Electronic Journal of Combinatorics
10 Applied Mathematics and Computation
8 SIAM Journal on Discrete Mathematics
8 Bulletin of the Malaysian Mathematical Sciences Society. Second Series
8 Optimization Letters
8 Discrete Mathematics, Algorithms and Applications
7 Applied Mathematics Letters
6 Journal of Computer and System Sciences
6 Linear Algebra and its Applications
6 Acta Mathematica Sinica. English Series
6 Electronic Journal of Graph Theory and Applications
5 Networks
5 Discrete Optimization
4 Information Sciences
4 International Journal of Computer Mathematics
4 Journal of Discrete Mathematical Sciences & Cryptography
4 RAIRO. Operations Research
4 Journal of Discrete Algorithms
4 AKCE International Journal of Graphs and Combinatorics
3 Czechoslovak Mathematical Journal
3 Siberian Mathematical Journal
3 Acta Mathematicae Applicatae Sinica. English Series
3 Information and Computation
3 The Australasian Journal of Combinatorics
3 Internet Mathematics
2 Indian Journal of Pure & Applied Mathematics
2 Annales Universitatis Mariae Curie-Skłodowska. Sectio A. Mathematica
2 Mathematische Nachrichten
2 Quaestiones Mathematicae
2 Combinatorica
2 Discrete Mathematics and Applications
2 Mathematical Programming. Series A. Series B
2 Computational Optimization and Applications
2 Applied Mathematics. Series B (English Edition)
2 Combinatorics, Probability and Computing
2 Finite Fields and their Applications
2 Boletín de la Sociedad Matemática Mexicana. Third Series
2 Mathematical Methods of Operations Research
2 Journal of Applied Mathematics and Computing
2 Ars Mathematica Contemporanea
2 Science China. Mathematics
2 Diskretnyĭ Analiz i Issledovanie Operatsiĭ
2 Open Mathematics
2 Prikladnaya Diskretnaya Matematika
1 Computers & Mathematics with Applications
1 International Journal of Control
1 Israel Journal of Mathematics
1 Computing
1 International Journal of Mathematics and Mathematical Sciences
1 Journal of Optimization Theory and Applications
1 Monatshefte für Mathematik
1 Proceedings of the American Mathematical Society
1 Proceedings of the London Mathematical Society. Third Series
1 Results in Mathematics
1 SIAM Journal on Computing
1 Tokyo Journal of Mathematics
1 Moscow University Computational Mathematics and Cybernetics
1 Advances in Applied Mathematics
1 Bulletin of the Korean Mathematical Society
1 Advances in Mathematics
1 Bulletin of the Iranian Mathematical Society
1 Optimization
1 Discrete & Computational Geometry
1 Computers & Operations Research
1 Random Structures & Algorithms
1 International Journal of Computational Geometry & Applications
1 Computational Geometry
1 International Journal of Foundations of Computer Science
1 European Journal of Operational Research
1 Acta Mathematica Sinica. New Series
1 Distributed Computing
1 Advances in Applied Clifford Algebras
1 Filomat
1 Opuscula Mathematica
1 Complexity
1 INFORMS Journal on Computing
1 ELA. The Electronic Journal of Linear Algebra
1 Journal of Mathematical Chemistry
1 Mathematical Problems in Engineering
1 Theory of Computing Systems
1 Optimization Methods & Software
1 Journal of Graph Algorithms and Applications
1 Communications de la Faculté des Sciences de l’Université d’Ankara. Séries A1. Mathematics and Statistics
1 Fundamenta Informaticae
1 Optimization and Engineering
1 Trudy Instituta Matematiki
1 Journal of the Australian Mathematical Society
1 Applied Mathematics E-Notes
1 Natural Computing
...and 16 more Serials

Citations by Year