Edit Profile (opens in new tab) Broersma, Hajo J. Compute Distance To: Compute Author ID: 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 Documents Indexed: 200 Publications since 1987 11 Contributions as Editor Co-Authors: 136 Co-Authors with 199 Joint Publications 3,886 Co-Co-Authors all top 5 Co-Authors 8 single-authored 25 Paulusma, Daniël 22 Veldman, Henk Jan 18 Zhang, Shenggui 17 Li, Xueliang 16 van den Heuvel, Jan 15 Bauer, Douglas 14 Fomin, Fedor V. 14 Woeginger, Gerhard Johannes 12 Golovach, Petr A. 12 Salman, A. N. M. 12 Wang, Ligong 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, Artem V. 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 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 Duijvestijn, A. J. W. 1 Engbers, Erik A. 1 Erlebach, Thomas 1 Friedetzky, Tom 1 Fujisawa, Jun 1 Holub, Premek 1 Hou, Jiangyou 1 Hu, Dan 1 Jackson, Bill 1 Jagers, A. A. 1 Jiang, He 1 Kang, Haiyan ...and 36 more Co-Authors all top 5 Serials 32 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 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 Applied Mathematics and Computation 2 European Journal of Combinatorics 2 JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing 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 Linear Algebra and its Applications 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 all top 5 Fields 195 Combinatorics (05-XX) 59 Computer science (68-XX) 12 General and overarching topics; collections (00-XX) 8 Operations research, mathematical programming (90-XX) 3 Biology and other natural sciences (92-XX) 2 Number theory (11-XX) 1 Linear and multilinear algebra; matrix theory (15-XX) 1 Information and communication theory, circuits (94-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 152 Publications have been cited 1,125 times in 807 Documents Cited by ▼ Year ▼ Not every 2-tough graph is Hamiltonian. Zbl 0934.05083Bauer, D.; Broersma, H. J.; Veldman, H. J. 38 2000 Toughness in graphs – a survey. Zbl 1088.05045Bauer, Douglas; Broersma, Hajo; Schmeichel, Edward 38 2006 Paths and cycles in colored graphs. Zbl 1061.05030Broersma, Hajo; Li, Xueliang; Woeginger, Gerhard; Zhang, Shenggui 31 2005 Independent sets in asteroidal triple-free graphs. Zbl 0918.68072Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko 31 1999 Updating the complexity status of coloring graphs without a fixed induced linear forest. Zbl 1234.68129Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian 30 2012 Independence trees and Hamilton cycles. Zbl 0919.05017Broersma, Hajo; Tuinstra, Hilde 29 1998 Spanning trees with many or few colors in edge-colored graphs. Zbl 0923.05018Broersma, Hajo; Li, Xueliang 28 1997 Path graphs. Zbl 0677.05068Broersma, H. J.; Hoede, C. 23 1989 A generalization of a result of Häggkvist and Nicoghossian. Zbl 0634.05053Bauer, Douglas; Broersma, H. J.; Veldman, H. J.; Rao, Li 21 1989 On factors of 4-connected claw-free graphs. Zbl 0984.05067Broersma, H. J.; Kriesell, M.; Ryjáček, Z. 20 2001 Minimal degrees and chromatic numbers of squares of planar graphs. Zbl 1012.05074Borodin, O. V.; Broersma, H.; Glebov, A. N.; van den Heuvel, Jan 19 2001 Cycles through subsets with large degree sums. Zbl 0883.05089Broersma, Hajo; Li, Hao; Li, Jianping; Tian, Feng; Veldman, Henk Jan 19 1997 Backbone colorings for graphs: tree and path backbones. Zbl 1118.05031Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J. 19 2007 Dirac’s minimum degree condition restricted to claws. Zbl 0880.05062Broersma, H. J.; Ryjáček, Z.; Schiermeyer, I. 18 1997 Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time. Zbl 1241.05030Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian 17 2012 A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Zbl 0940.05064Broersma, H. J.; Dahlhaus, E.; Kloks, T. 17 2000 Best monotone degree conditions for graph properties: a survey. Zbl 1306.05032Bauer, D.; Broersma, H. J.; Den Heuvel, J.van; Kahl, N.; Nevo, A.; Schmeichel, E.; Woodall, D. R.; Yatauro, M. 17 2015 3-connected line graphs of triangular graphs are panconnected and 1- Hamiltonian. Zbl 0656.05045Broersma, H. J.; Veldman, H. J. 16 1987 Complexity of conditional colorability of graphs. Zbl 1188.05064Li, Xueliang; Yao, Xiangmei; Zhou, Wenli; Broersma, Hajo 16 2009 Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël 15 2013 The Hamiltonian index of a graph and its branch-bonds. Zbl 1044.05049Xiong, Liming; Broersma, H. J.; Li, Xueliang; Li, Mingchu 15 2004 Closure concepts: A survey. Zbl 0946.05051Broersma, Hajo; Ryjáček, Zdeněk; Schiermeyer, Ingo 15 2000 \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings. Zbl 1213.05068Broersma, H. J.; Fujisawa, J.; Marchal, L.; Paulusma, D.; Salman, A. N. M.; Yoshimoto, K. 14 2009 A generalization of Ore’s Theorem involving neighborhood unions. Zbl 0789.05058Broersma, H. J.; van den Heuvel, J.; Veldman, H. J. 14 1993 On star-critical and upper size Ramsey numbers. Zbl 1330.05157Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun 13 2016 The structure of the planar triangulations in terms of bundles and stars. Zbl 0977.05036Borodin, O. V.; Broersma, H.; Glebov, A. N.; van den Heuvel, J. 13 2001 Heavy cycles in weighted graphs. Zbl 1012.05104Bondy, J. Adrian; Broersma, Hajo J.; van den Heuvel, Jan; Veldman, Henk Jan 13 2002 A note on minimum degree conditions for supereulerian graphs. Zbl 0993.05097Broersma, H. J.; Xiong, Liming 12 2002 On some intriguing problems in Hamiltonian graph theory—a survey. Zbl 0998.05040Broersma, H. J. 12 2002 Three complexity results on coloring \(P _{k }\)-free graphs. Zbl 1267.05113Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël 11 2009 Forbidden subgraphs that imply Hamiltonian-connectedness. Zbl 0999.05067Broersma, Hajo; Faudree, Ralph J.; Huck, Andreas; Trommel, Huib; Veldman, Henk Jan 11 2002 Toughness and hamiltonicity in almost claw-free graphs. Zbl 0847.05069Broersma, H. J.; Ryjáček, Z.; Schiermeyer, I. 11 1996 Path-fan Ramsey numbers. Zbl 1093.05043Salman, A. N. M.; Broersma, H. J. 11 2006 Existence of \(\Delta _{\lambda}\)-cycles and \(\Delta _{\lambda}\)- paths. Zbl 0662.05038Broersma, H. J. 11 1988 More about subcolorings. Zbl 1239.05060Broersma, Hajo; Fomin, Fedor V.; Nešetřil, Jaroslav; Woeginger, Gerhard J. 10 2002 On toughness and Hamiltonicity of \(2K_{2}\)-free graphs. Zbl 1292.05162Broersma, Hajo; Patel, Viresh; Pyatkin, Artem 10 2014 Cycles through particular subgraphs of claw-free graphs. Zbl 0835.05042Broersma, H. J.; Lu, M. 10 1995 Long cycles in graphs with prescribed toughness and minimum degree. Zbl 0831.05039Bauer, Douglas; Broersma, H. J.; van den Heuvel, J.; Veldman, H. J. 10 1995 Generating all 3-connected 4-regular planar graphs from the Octahedron Graph. Zbl 0781.05047Broersma, H. J.; Duijvestijn, A. J. W.; Göbel, F. 10 1993 Heavy paths and cycles in weighted graphs. Zbl 0967.05040Zhang, Shenggui; Li, Xueliang; Broersma, Hajo 10 2000 Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej 9 2015 Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Zbl 1157.05041Broersma, Hajo; Fijavž, Gašper; Kaiser, Tomáš; Kužel, Roman; Ryjáček, Zdeněk; Vrána, Petr 9 2008 How many conjectures can you stand? A survey. Zbl 1234.05146Broersma, H. J.; Ryjáček, Z.; Vrána, P. 9 2012 The Ramsey numbers of large cycles versus small wheels. Zbl 1061.05063Surahmat; Baskoro, E. T.; Broersma, H. J. 9 2004 On hamiltonian properties of 2-tough graphs. Zbl 0815.05042Bauer, D.; Broersma, H. J.; van den Heuvel, J.; Veldman, H. J. 9 1994 Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs. Zbl 1112.05059Brandt, Stephan; Broersma, Hajo; Diestel, Reinhard; Kriesell, Matthias 9 2006 Remarks on Hamiltonian properties of claw-free graphs. Zbl 0715.05048Ainouche, A.; Broersma, H. J.; Veldman, H. J. 9 1990 Restrictions on induced subgraphs ensuring hamiltonicity or pancyclicity of \(K_{1,3}\)-free graphs. Zbl 0723.05082Broersma, Hajo; Veldman, Henk Jan 9 1990 Backbone colorings for networks. Zbl 1255.05076Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J. 8 2003 Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Zbl 1095.68075Broersma, Hajo; Fomin, Fedor V.; Kratochvil, Jan; Woeginger, Gerhard J. 8 2006 Strengthening the closure concept in claw-free graphs. Zbl 0981.05067Broersma, Hajo; Ryjáček, Zdeněk 8 2001 Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Zbl 1210.05064Broersma, Hajo; Paulusma, Daniël; Yoshimoto, Kiyoshi 7 2009 A general framework for coloring problems: Old results, new results, and open problems. Zbl 1117.05038Broersma, Hajo 7 2005 Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Zbl 1181.05036Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M. 7 2009 A new algorithm for on-line coloring bipartite graphs. Zbl 1181.05035Broersma, Hajo J.; Capponi, Agostino; Paulusma, Daniël 7 2008 A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs. Zbl 1312.68234Wang, Limin; Zhang, Xiaoyan; Zhang, Zhao; Broersma, Hajo 7 2015 Subgraph conditions for dominating circuits in graphs and pancyclicity of line graphs. Zbl 0641.05036Broersma, H. J. 7 1987 Toughness and Hamiltonicity in \(k\)-trees. Zbl 1117.05069Broersma, Hajo; Xiong, Liming; Yoshimoto, Kiyoshi 7 2007 The connectivity of the leaf-exchange spanning tree graph of a graph. Zbl 0881.05076Broersma, H. J.; Xueliang, L. 7 1996 Degree-preserving trees. Zbl 0938.90065Broersma, Hajo; Koppius, Otto; Tuinstra, Hilde; Huck, Andreas; Kloks, Ton; Kratsch, Dieter; Müller, Haiko 6 2000 A generalization of AT-free graphs and a generic algorithm for solving triangulation problems. Zbl 1009.68099Broersma, H. J.; Kloks, T.; Kratsch, D.; Müller, H. 6 2002 A note on \(K_ 4\)-closures in hamiltonian graph theory. Zbl 0789.05057Broersma, H. J. 6 1993 Spanning trees with pairwise nonadjacent endvertices. Zbl 0876.05020Böhme, T.; Broersma, H. J.; Göbel, F.; Kostochka, A. V.; Stiebitz, Michael 6 1997 Properly edge-colored theta graphs in edge-colored complete graphs. Zbl 1407.05097Li, Ruonan; Broersma, Hajo; Zhang, Shenggui 6 2019 Around three lemmas in Hamiltonian graph theory. Zbl 0736.05054Bauer, D.; Broersma, H. J.; Veldman, H. J. 6 1990 Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Zbl 1297.05163Broersma, Hajo; Golovach, Petr A.; Patel, Viresh 5 2013 Forbidden subgraphs for Hamiltonicity of 1-tough graphs. Zbl 1350.05088Li, Binlong; Broersma, Hajo J.; Zhang, Shenggui 5 2016 Degree sequences and the existence of \(k\)-factors. Zbl 1256.05051Bauer, D.; Broersma, H. J.; van den Heuvel, J.; Kahl, N.; Schmeichel, E. 5 2012 Toughness and vertex degrees. Zbl 1259.05040Bauer, D.; Broersma, H. J.; Van den Heuvel, J.; Kahl, N.; Schmeichel, E. 5 2013 Removable edges and chords of longest cycles in 3-connected graphs. Zbl 1291.05113Wu, Jichang; Broersma, Hajo; Kang, Haiyan 5 2014 On generalizing a theorem of Jung. Zbl 0843.05071Bauer, Douglas; Broersma, H. J.; Veldman, H. J. 5 1995 A fan type condition for heavy cycles in weighted graphs. Zbl 0994.05090Zhang, Shenggui; Broersma, Hajo; Li, Xueliang; Wang, Ligong 5 2002 Hamiltonicity of regular 2-connected graphs. Zbl 0864.05058Broersma, H. J.; van den Heuvel, J.; Jackson, B.; Veldman, H. J. 5 1996 Closure concepts for claw-free graphs. Zbl 0955.05087Broersma, H. J.; Trommel, H. 5 1998 An upper bound for the Ramsey number of a cycle of length four versus wheels. Zbl 1117.05077Surahmat; Baskoro, Edy Tri; Uttunggadewa, Saladin; Broersma, Hajo 5 2005 A remark on star-\(C_4\) and wheel-\(C_4\) Ramsey numbers. Zbl 1306.05152Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun 5 2014 Long dominating cycles and paths in graphs with large neighborhood unions. Zbl 0729.05032Broersma, H. J.; Veldman, H. J. 5 1991 On Ramsey numbers for paths versus wheels. Zbl 1115.05060Salman, A. N. M.; Broersma, H. J. 5 2007 The connectivity of the basis graph of a branching greedoid. Zbl 0765.05062Broersma, H. J.; Li, Xueliang 5 1992 Path-kipas Ramsey numbers. Zbl 1128.05037Salman, A. N. M.; Broersma, H. J. 5 2007 The Ramsey numbers of fans versus \(K_4\). Zbl 1067.05049Surahmat; Baskoro, E. T.; Broersma, H. J. 5 2005 A \(\sigma_3\) type condition for heavy cycles in weighted graphs. Zbl 1002.05047Zhang, Shenggui; Li, Xueliang; Broersma, Hajo 5 2001 Independent sets in asteroidal triple-free graphs. Zbl 1401.05278Broersma, Hajo; Kloks, Ton; Kratsch, Dieter; Müller, Haiko 5 1997 Cycle extension in edge-colored complete graphs. Zbl 1369.05080Li, Ruonan; Broersma, Hajo; Xu, Chuandong; Zhang, Shenggui 4 2017 Fully decomposable split graphs. Zbl 1257.05125Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J. 4 2013 Exact algorithms for finding longest cycles in claw-free graphs. Zbl 1259.05162Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël 4 2013 Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Zbl 1234.05144Li, Mingchu; Chen, Xiaodong; Broersma, Hajo 4 2011 Connected even factors in claw-free graphs. Zbl 1143.05067Li, Mingchu; Xiong, Liming; Broersma, H. J. 4 2008 Some families of integral graphs. Zbl 1171.05364Wang, Ligong; Broersma, Hajo; Hoede, Cornelis; Li, Xueliang; Still, Georg 4 2008 Spanning 2-connected subgraphs in alphabet graphs, special classes of grid graphs. Zbl 1053.05093Salman, A. N. M.; Broersma, Hajo; Baskoro, Edy Tri 4 2003 On graphs satisfying a local Ore-type condition. Zbl 0839.05066Asratian, A. S.; Broersma, H. J.; van den Heuvel, J.; Veldman, H. J. 4 1996 On stability of the Hamiltonian index under contractions and closures. Zbl 1065.05060Xiong, Liming; Ryjáček, Zdeněk; Broersma, Hajo 4 2005 On hamiltonicity of \(P_{3}\)-dominated graphs. Zbl 1161.05331Broersma, H. J.; Vumar, E. 4 2009 Long paths and cycles in tough graphs. Zbl 0778.05047Broersma, H. J.; van den Heuvel, J.; Jung, H. A.; Veldman, H. J. 4 1993 Another equivalent of the graceful tree conjecture. Zbl 0977.05114Broersma, H. J.; Hoede, C. 4 1999 Eliminating graphs by means of parallel knock-out schemes. Zbl 1109.05091Broersma, Hajo; Fomin, Fedor V.; Královič, Rastislav; Woeginger, Gerhard J. 4 2007 Tutte sets in graphs. I: Maximal Tutte sets and \(D\)-graphs. Zbl 1120.05067Bauer, D.; Broersma, H. J.; Morgana, A.; Schmeichel, E. 4 2007 Paths and cycles in colored graphs. Zbl 1412.05070Li, Xueliang; Zhang, Shenggui; Broersma, Hajo 3 2001 Improved upper bounds for \(\lambda \)-backbone colorings along matchings and stars. Zbl 1131.05301Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M. 3 2007 The computational complexity of the parallel knock-out problem. Zbl 1136.68028Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A. 3 2008 Almost Eulerian compatible spanning circuits in edge-colored graphs. Zbl 1455.05039Guo, Zhiwei; Broersma, Hajo; Li, Binlong; Zhang, Shenggui 1 2021 Sharp upper bounds for augmented Zagreb index of graphs with fixed parameters. Zbl 1473.92080Li, Fengwei; Ye, Qingfang; Broersma, Hajo; Ye, Ruixuan 1 2021 Properly edge-colored theta graphs in edge-colored complete graphs. Zbl 1407.05097Li, Ruonan; Broersma, Hajo; Zhang, Shenggui 6 2019 Extremal benzenoid systems for two modified versions of the Randić index. Zbl 1427.92102Li, Fengwei; Broersma, Hajo; Rada, Juan; Sun, Yuefang 2 2018 Conditions for graphs to be path partition optimal. Zbl 1383.05187Li, Binlong; Broersma, Hajo; Zhang, Shenggui 1 2018 Cycle extension in edge-colored complete graphs. Zbl 1369.05080Li, Ruonan; Broersma, Hajo; Xu, Chuandong; Zhang, Shenggui 4 2017 Extremal and degree conditions for path extendability in digraphs. Zbl 1370.05083Zhang, Zan-Bo; Zhang, Xiaoyan; Broersma, Hajo; Lou, Dingjun 1 2017 On star-critical and upper size Ramsey numbers. Zbl 1330.05157Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun 13 2016 Forbidden subgraphs for Hamiltonicity of 1-tough graphs. Zbl 1350.05088Li, Binlong; Broersma, Hajo J.; Zhang, Shenggui 5 2016 Narrowing down the gap on cycle-star Ramsey numbers. Zbl 1338.05179Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun 1 2016 On the complexity of edge-colored subgraph partitioning problems in network optimization. Zbl 1343.05067Zhang, Xiaoyan; Zhang, Zan-Bo; Broersma, Hajo; Wen, Xuelian 1 2016 Hamiltonian properties of almost locally connected claw-free graphs. Zbl 1413.05200Chen, Xiaodong; Li, MingChu; Liao, Wei; Broersma, Hajo 1 2016 On fan-wheel and tree-wheel Ramsey numbers. Zbl 1338.05180Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun 1 2016 Best monotone degree conditions for graph properties: a survey. Zbl 1306.05032Bauer, D.; Broersma, H. J.; Den Heuvel, J.van; Kahl, N.; Nevo, A.; Schmeichel, E.; Woodall, D. R.; Yatauro, M. 17 2015 Linear-time algorithms for scattering number and Hamilton-connectivity of interval graphs. Zbl 1316.05080Broersma, Hajo; Fiala, Jiří; Golovach, Petr A.; Kaiser, Tomáš; Paulusma, Daniël; Proskurowski, Andrzej 9 2015 A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs. Zbl 1312.68234Wang, Limin; Zhang, Xiaoyan; Zhang, Zhao; Broersma, Hajo 7 2015 How tough is toughness? Zbl 1409.68207Broersma, Hajo 3 2015 Characterizing heavy subgraph pairs for pancyclicity. Zbl 1312.05092Li, Binlong; Ning, Bo; Broersma, Hajo; Zhang, Shenggui 1 2015 Ramsey numbers of trees versus fans. Zbl 1371.05177Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun 1 2015 A note on Ramsey numbers for fans. Zbl 1319.05134Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun 1 2015 On toughness and Hamiltonicity of \(2K_{2}\)-free graphs. Zbl 1292.05162Broersma, Hajo; Patel, Viresh; Pyatkin, Artem 10 2014 Removable edges and chords of longest cycles in 3-connected graphs. Zbl 1291.05113Wu, Jichang; Broersma, Hajo; Kang, Haiyan 5 2014 A remark on star-\(C_4\) and wheel-\(C_4\) Ramsey numbers. Zbl 1306.05152Zhang, Yanbo; Broersma, Hajo; Chen, Yaojun 5 2014 Heavy subgraph pairs for traceability of block-chains. Zbl 1290.05099Li, Binlong; Broersma, Hajo; Zhang, Shenggui 1 2014 Three complexity results on coloring \(P_k\)-free graphs. Zbl 1257.05037Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël 15 2013 Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Zbl 1297.05163Broersma, Hajo; Golovach, Petr A.; Patel, Viresh 5 2013 Toughness and vertex degrees. Zbl 1259.05040Bauer, D.; Broersma, H. J.; Van den Heuvel, J.; Kahl, N.; Schmeichel, E. 5 2013 Fully decomposable split graphs. Zbl 1257.05125Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J. 4 2013 Exact algorithms for finding longest cycles in claw-free graphs. Zbl 1259.05162Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël 4 2013 Forbidden subgraph pairs for traceability of block-chains. Zbl 1306.05205Li, Binlong; Broersma, Hajo; Zhang, Shenggui 3 2013 Updating the complexity status of coloring graphs without a fixed induced linear forest. Zbl 1234.68129Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian 30 2012 Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time. Zbl 1241.05030Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian 17 2012 How many conjectures can you stand? A survey. Zbl 1234.05146Broersma, H. J.; Ryjáček, Z.; Vrána, P. 9 2012 Degree sequences and the existence of \(k\)-factors. Zbl 1256.05051Bauer, 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.68095Broersma, Hajo; Golovach, Petr A.; Patel, Viresh 1 2012 Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Zbl 1234.05144Li, Mingchu; Chen, Xiaodong; Broersma, Hajo 4 2011 The complexity status of problems related to sparsest cuts. Zbl 1326.68145Bonsma, Paul; Broersma, Hajo; Patel, Viresh; Pyatkin, Artem 2 2011 Computing sharp 2-factors in claw-free graphs. Zbl 1231.05210Broersma, Hajo; Paulusma, Daniël 2 2010 Fast exact algorithms for Hamiltonicity in claw-free graphs. Zbl 1273.05216Broersma, Hajo; Fomin, Fedor V.; van ’t Hof, Pim; Paulusma, Daniël 1 2010 On coloring graphs without induced forests. Zbl 1310.68100Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian 1 2010 Narrowing down the gap on the complexity of coloring \(P _{k }\)-free graphs. Zbl 1308.68063Broersma, Hajo; Golovach, Petr A.; Paulusma, Daniël; Song, Jian 1 2010 Complexity of conditional colorability of graphs. Zbl 1188.05064Li, Xueliang; Yao, Xiangmei; Zhou, Wenli; Broersma, Hajo 16 2009 \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings. Zbl 1213.05068Broersma, H. J.; Fujisawa, J.; Marchal, L.; Paulusma, D.; Salman, A. N. M.; Yoshimoto, K. 14 2009 Three complexity results on coloring \(P _{k }\)-free graphs. Zbl 1267.05113Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Paulusma, Daniël 11 2009 Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Zbl 1210.05064Broersma, Hajo; Paulusma, Daniël; Yoshimoto, Kiyoshi 7 2009 Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Zbl 1181.05036Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M. 7 2009 On hamiltonicity of \(P_{3}\)-dominated graphs. Zbl 1161.05331Broersma, H. J.; Vumar, E. 4 2009 Fully decomposable split graphs. Zbl 1267.05245Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J. 1 2009 Upper bounds and algorithms for parallel knock-out numbers. Zbl 1164.68026Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël 1 2009 Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Zbl 1157.05041Broersma, 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.05035Broersma, Hajo J.; Capponi, Agostino; Paulusma, Daniël 7 2008 Connected even factors in claw-free graphs. Zbl 1143.05067Li, Mingchu; Xiong, Liming; Broersma, H. J. 4 2008 Some families of integral graphs. Zbl 1171.05364Wang, Ligong; Broersma, Hajo; Hoede, Cornelis; Li, Xueliang; Still, Georg 4 2008 The computational complexity of the parallel knock-out problem. Zbl 1136.68028Broersma, 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.05044Surahmat; Baskoro, Edy Tri; Broersma, H. J. 2 2008 Computing sharp 2-factors in claw-free graphs. Zbl 1173.05348Broersma, Hajo; Paulusma, Daniël 1 2008 Backbone colorings for graphs: tree and path backbones. Zbl 1118.05031Broersma, Hajo; Fomin, Fedor V.; Golovach, Petr A.; Woeginger, Gerhard J. 19 2007 Toughness and Hamiltonicity in \(k\)-trees. Zbl 1117.05069Broersma, Hajo; Xiong, Liming; Yoshimoto, Kiyoshi 7 2007 On Ramsey numbers for paths versus wheels. Zbl 1115.05060Salman, A. N. M.; Broersma, H. J. 5 2007 Path-kipas Ramsey numbers. Zbl 1128.05037Salman, A. N. M.; Broersma, H. J. 5 2007 Eliminating graphs by means of parallel knock-out schemes. Zbl 1109.05091Broersma, Hajo; Fomin, Fedor V.; Královič, Rastislav; Woeginger, Gerhard J. 4 2007 Tutte sets in graphs. I: Maximal Tutte sets and \(D\)-graphs. Zbl 1120.05067Bauer, D.; Broersma, H. J.; Morgana, A.; Schmeichel, E. 4 2007 Improved upper bounds for \(\lambda \)-backbone colorings along matchings and stars. Zbl 1131.05301Broersma, Hajo; Marchal, Bert; Paulusma, Daniel; Salman, A. N. M. 3 2007 A new upper bound on the cyclic chromatic number. Zbl 1109.05042Borodin, O. V.; Broersma, H. J.; Glebov, A.; van den Heuvel, J. 3 2007 Tutte sets in graphs. II: The complexity of finding maximum Tutte sets. Zbl 1119.05086Bauer, D.; Broersma, H. J.; Kahl, N.; Morgana, A.; Schmeichel, E.; Surowiec, T. 3 2007 On the complexity of dominating set problems related to the minimum all-ones problem. Zbl 1124.68076Broersma, Hajo; Li, Xueliang 1 2007 Integral trees of diameter 6. Zbl 1119.05070Wang, Ligong; Broersma, Hajo; Hoede, Cornelis; Li, Xueliang; Still, Georg 1 2007 Toughness in graphs – a survey. Zbl 1088.05045Bauer, Douglas; Broersma, Hajo; Schmeichel, Edward 38 2006 Path-fan Ramsey numbers. Zbl 1093.05043Salman, A. N. M.; Broersma, H. J. 11 2006 Global connectivity and expansion: long cycles and factors in \(f\)-connected graphs. Zbl 1112.05059Brandt, Stephan; Broersma, Hajo; Diestel, Reinhard; Kriesell, Matthias 9 2006 Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Zbl 1095.68075Broersma, Hajo; Fomin, Fedor V.; Kratochvil, Jan; Woeginger, Gerhard J. 8 2006 On-line coloring of \(H\)-free bipartite graphs. Zbl 1183.68748Broersma, H. J.; Capponi, A.; Paulusma, D. 2 2006 The computational complexity of the parallel knock-out problem. Zbl 1145.68433Broersma, Hajo; Johnson, Matthew; Paulusma, Daniël; Stewart, Iain A. 1 2006 Paths and cycles in colored graphs. Zbl 1061.05030Broersma, Hajo; Li, Xueliang; Woeginger, Gerhard; Zhang, Shenggui 31 2005 A general framework for coloring problems: Old results, new results, and open problems. Zbl 1117.05038Broersma, Hajo 7 2005 An upper bound for the Ramsey number of a cycle of length four versus wheels. Zbl 1117.05077Surahmat; Baskoro, Edy Tri; Uttunggadewa, Saladin; Broersma, Hajo 5 2005 The Ramsey numbers of fans versus \(K_4\). Zbl 1067.05049Surahmat; Baskoro, E. T.; Broersma, H. J. 5 2005 On stability of the Hamiltonian index under contractions and closures. Zbl 1065.05060Xiong, Liming; Ryjáček, Zdeněk; Broersma, Hajo 4 2005 The Hamiltonian index of a graph and its branch-bonds. Zbl 1044.05049Xiong, Liming; Broersma, H. J.; Li, Xueliang; Li, Mingchu 15 2004 The Ramsey numbers of large cycles versus small wheels. Zbl 1061.05063Surahmat; Baskoro, E. T.; Broersma, H. J. 9 2004 Radio labeling with preassigned frequencies. Zbl 1071.05033Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor V.; Pyatkin, Artem V.; Woeginger, Gerhard J. 3 2004 The Ramsey numbers of paths versus kipases. Zbl 1125.05314Salman, A. N. M.; Broersma, H. J. 2 2004 Parallel knock-out schemes in networks. Zbl 1096.68118Broersma, Hajo; Fomin, Fedor V.; Woeginger, Gerhard J. 1 2004 Backbone colorings for networks. Zbl 1255.05076Broersma, 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.05093Salman, A. N. M.; Broersma, Hajo; Baskoro, Edy Tri 4 2003 Heavy cycles in weighted graphs. Zbl 1012.05104Bondy, J. Adrian; Broersma, Hajo J.; van den Heuvel, Jan; Veldman, Henk Jan 13 2002 A note on minimum degree conditions for supereulerian graphs. Zbl 0993.05097Broersma, H. J.; Xiong, Liming 12 2002 On some intriguing problems in Hamiltonian graph theory—a survey. Zbl 0998.05040Broersma, H. J. 12 2002 Forbidden subgraphs that imply Hamiltonian-connectedness. Zbl 0999.05067Broersma, Hajo; Faudree, Ralph J.; Huck, Andreas; Trommel, Huib; Veldman, Henk Jan 11 2002 More about subcolorings. Zbl 1239.05060Broersma, 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.68099Broersma, H. J.; Kloks, T.; Kratsch, D.; Müller, H. 6 2002 A fan type condition for heavy cycles in weighted graphs. Zbl 0994.05090Zhang, Shenggui; Broersma, Hajo; Li, Xueliang; Wang, Ligong 5 2002 Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion. Zbl 1052.68097Bauer, D.; Broersma, H. J.; Morgana, A.; Schmeichel, E. 3 2002 Isomorphisms and traversability of directed path graphs. Zbl 1029.05129Broersma, Hajo; Li, Xueliang 2 2002 Some approaches to a conjecture on short cycles in digraphs. Zbl 1002.05030Broersma, H. J.; Li, Xueliang 2 2002 Radio labeling with pre-assigned frequencies. Zbl 1020.05062Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor V.; Pyatkin, Artem V.; Woeginger, Gerhard J. 1 2002 More progress on tough graphs – the Y2K report. Zbl 1075.05559Bauer, Doug; Broersma, Hajo; Schmeichel, Edward 1 2002 Degree sums and subpancyclicity in line graphs. Zbl 0987.05062Xiong, Liming; Broersma, H. J.; Hoede, C.; Li, Xueliang 1 2002 On factors of 4-connected claw-free graphs. Zbl 0984.05067Broersma, H. J.; Kriesell, M.; Ryjáček, Z. 20 2001 Minimal degrees and chromatic numbers of squares of planar graphs. Zbl 1012.05074Borodin, O. V.; Broersma, H.; Glebov, A. N.; van den Heuvel, Jan 19 2001 ...and 52 more Documents all cited Publications top 5 cited Publications all top 5 Cited by 1,045 Authors 50 Broersma, Hajo J. 38 Xiong, Liming 31 Lai, Hong-Jian 31 Paulusma, Daniël 20 Ozeki, Kenta 20 Ryjáček, Zdeněk 19 Li, Binlong 18 Golovach, Petr A. 18 Li, Hao 18 Zhang, Shenggui 17 Yamashita, Tomoki 17 Yoshimoto, Kiyoshi 14 Tsugaki, Masao 14 Vrána, Petr 13 Bauer, Douglas 12 Kratsch, Dieter 11 Borodin, Oleg Veniaminovich 11 Ivanova, Anna Olegovna 11 Malyshev, Dmitry S. 10 Fujisawa, Jun 10 Ning, Bo 10 Schmeichel, Edward F. 10 Veldman, Henk Jan 10 Zhan, Mingquan 9 Chiba, Shuya 9 Li, Xueliang 9 Li, Yusheng 9 Wei, Bing 8 Čada, Roman 8 Chen, Guantao 8 Chen, Yaojun 8 Liu, Guizhen 8 Song, Jian 8 Tian, Feng 8 van den Heuvel, Jan 8 Wang, Ligong 8 Wang, Ye 7 Brandstädt, Andreas 7 Bu, Yuehua 7 Cai, Junqing 7 Gould, Ronald J. 7 Li, Mingchu 7 Saito, Akira 6 Cheng, Tai-Chiu Edwin 6 Dabrowski, Konrad Kazimierz 6 Feng, Lihua 6 Johnson, Matthew 6 Kano, Mikio 6 Monnot, Jérôme 6 Shan, Songling 6 Sudakov, Benny 6 Van Leeuwen, Erik Jan 6 Zhou, Sanming 5 Ainouche, Ahmed 5 Balbuena, Camino 5 Cerulli, Raffaele 5 Faudree, Ralph Jasper jun. 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 Kaiser, Tomáš 5 Katona, Gyula Y. 5 Liu, Weijun 5 Lozin, Vadim Vladislavovich 5 Mathew Karakkad, Sunil 5 Matsuda, Haruhide 5 Müller, Haiko 5 Nevo, Aori 5 Orlovich, Yury L. 5 Ota, Katsuhiro 5 Rivera-Campo, Eduardo 5 Salman, A. N. M. 5 Schiermeyer, Ingo 5 Turowski, Krzysztof 5 Venkatachalam, Mathiyazhagan 5 Vumar, Elkin 5 Wu, Baoyindureng 5 Zhang, Xiaoyan 5 Zhang, Zhao 4 Asratian, Armen S. 4 Bagheri, Alireza 4 Baskoro, Edy Tri 4 Bielak, Halina 4 Chen, Bing 4 Cioabă, Sebastian M. 4 Fujita, Shinya 4 Golumbic, Martin Charles 4 Gordon, Valery S. 4 Harant, Jochen 4 Heggernes, Pinar 4 Hu, Zhiquan 4 Huang, Shenwei 4 Huang, Xing 4 Janczewski, Robert 4 Jendrol’, Stanislav 4 Kabela, Adam 4 Kahl, Nathan ...and 945 more Authors all top 5 Cited in 109 Serials 178 Discrete Mathematics 120 Discrete Applied Mathematics 91 Graphs and Combinatorics 34 Theoretical Computer Science 24 Journal of Graph Theory 22 Discussiones Mathematicae. 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 11 The Electronic Journal of Combinatorics 10 Applied Mathematics and Computation 8 Optimization Letters 8 Discrete Mathematics, Algorithms and Applications 7 Applied Mathematics Letters 7 Bulletin of the Malaysian Mathematical Sciences Society. Second Series 6 Journal of Computer and System Sciences 6 SIAM Journal on Discrete Mathematics 6 Linear Algebra and its Applications 6 Acta Mathematica Sinica. English Series 5 Networks 5 Discrete Optimization 4 Information Sciences 4 International Journal of Computer Mathematics 4 RAIRO. Operations Research 4 Journal of Discrete Algorithms 4 AKCE International Journal of Graphs and Combinatorics 4 Electronic Journal of Graph Theory and Applications 3 Siberian Mathematical Journal 3 Information and Computation 3 The Australasian Journal of Combinatorics 3 Journal of Discrete Mathematical Sciences & Cryptography 3 Internet Mathematics 2 Indian Journal of Pure & Applied Mathematics 2 Annales Universitatis Mariae Curie-Skłodowska. Sectio A. Mathematica 2 Czechoslovak Mathematical Journal 2 Mathematische Nachrichten 2 Quaestiones Mathematicae 2 Combinatorica 2 Acta Mathematicae Applicatae Sinica. English Series 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 Ars Mathematica Contemporanea 2 Science China. Mathematics 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 Bulletin of the Korean Mathematical Society 1 Bulletin of the Iranian Mathematical Society 1 Optimization 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 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 1 Journal of Applied Mathematics and Computing 1 Proyecciones 1 Frontiers of Mathematics in China 1 Journal of Mathematical Inequalities 1 Applicable Analysis and Discrete Mathematics 1 Discrete and Continuous Dynamical Systems. Series S ...and 9 more Serials all top 5 Cited in 16 Fields 757 Combinatorics (05-XX) 163 Computer science (68-XX) 51 Operations research, mathematical programming (90-XX) 6 Linear and multilinear algebra; matrix theory (15-XX) 5 Biology and other natural sciences (92-XX) 3 Number theory (11-XX) 3 Convex and discrete geometry (52-XX) 2 History and biography (01-XX) 2 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 1 General and overarching topics; collections (00-XX) 1 Mathematical logic and foundations (03-XX) 1 Commutative algebra (13-XX) 1 Ordinary differential equations (34-XX) 1 Geometry (51-XX) 1 Numerical analysis (65-XX) 1 Information and communication theory, circuits (94-XX) Citations by Year