Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHajo Broersma
Haitze J. Broersma
Person information
- affiliation: University of Twente, Department of Applied Mathematics, Enschede, The Netherlands
- affiliation: Durham University, Department of Computer Science, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j169]Yanni Dong, Hajo Broersma
, Yuhang Bai, Shenggui Zhang:
The complexity of spanning tree problems involving graphical indices. Discret. Appl. Math. 347: 143-154 (2024)- [j168]Xiuwen Yang, Hajo Broersma, Ligong Wang:
Sharp bounds for Laplacian spectral moments of digraphs with a fixed dichromatic number. Discret. Math. 347(1): 113659 (2024) - [j167]Fangfang Wu, Hajo Broersma, Shenggui Zhang, Binlong Li:
Properly colored and rainbow C 4 ${C}_{4}$ 's in edge-colored graphs. J. Graph Theory 105(1): 110-135 (2024) - [c37]Antonios Antoniadis, Hajo Broersma, Yang Meng:
Online Graph Coloring with Predictions. ISCO 2024: 289-302 - 2023
- [j166]Yanni Dong, Hajo Broersma, Changwu Song, Pengfei Wan, Shenggui Zhang:
The effect of graph operations on the degree-based entropy. Appl. Math. Comput. 437: 127533 (2023) - [j165]Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang:
Polynomial algorithms for computing the isolated toughness of interval and split graphs. Concurr. Comput. Pract. Exp. 35(17) (2023) - [j164]Tingting Han, Hajo Broersma, Yandong Bai, Shenggui Zhang:
Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs. Discret. Appl. Math. 327: 101-109 (2023) - [i4]Antonios Antoniadis, Hajo Broersma, Yang Meng:
Online Graph Coloring with Predictions. CoRR abs/2312.00601 (2023) - 2022
- [j163]Fengwei Li, Qingfang Ye, Hajo Broersma:
Some New Bounds for the Inverse Sum Indeg Energy of Graphs. Axioms 11(5): 243 (2022) - [j162]Xihe Li, Hajo Broersma, Ligong Wang:
Integer Colorings with No Rainbow 3-Term Arithmetic Progression. Electron. J. Comb. 29(2) (2022) - [j161]Guowei Dai, Zan-Bo Zhang, Hajo Broersma, Xiaoyan Zhang:
The Hamiltonian properties in K1, r-free split graphs. Discret. Math. 345(6): 112826 (2022) - [j160]Xiangxiang Liu, Hajo Broersma, Ligong Wang:
On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees. Discret. Math. 345(12): 113112 (2022) - [j159]Wei Zheng, Hajo Broersma, Ligong Wang:
Toughness, forbidden subgraphs, and Hamiltonian-connected graphs. Discuss. Math. Graph Theory 42(1): 187-196 (2022) - [j158]Xihe Li, Hajo Broersma, Ligong Wang:
The Erdős-Gyárfás function with respect to Gallai-colorings. J. Graph Theory 101(2): 242-264 (2022) - 2021
- [j157]Fengwei Li, Qingfang Ye, Hajo Broersma, Ruixuan Ye, Xiao-Yan Zhang:
Extremality of VDB topological indices over f-benzenoids with given order. Appl. Math. Comput. 393: 125757 (2021) - [j156]Dan Hu, Hajo Broersma, Jiangyou Hou, Shenggui Zhang:
On the Spectra of General Random Mixed Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j155]Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu:
On sufficient spectral radius conditions for hamiltonicity. Discret. Appl. Math. 296: 26-38 (2021) - [j154]Zhiwei Guo, Hajo Broersma, Binlong Li, Shenggui Zhang:
Almost eulerian compatible spanning circuits in edge-colored graphs. Discret. Math. 344(1): 112174 (2021) - [j153]Xihe Li, Hajo Broersma, Ligong Wang:
Extremal problems and results related to Gallai-colorings. Discret. Math. 344(11): 112567 (2021) - [j152]Hajo Broersma, Qin Ma, Yaping Mao, Jichang Wu:
Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph. Discuss. Math. Graph Theory 41(2): 559-587 (2021) - [j151]Wei Zheng, Hajo Broersma, Ligong Wang:
On hamiltonicity of 1-tough triangle-free graphs. Electron. J. Graph Theory Appl. 9(2): 433-442 (2021) - [j150]Wei Zheng, Hajo Broersma, Ligong Wang:
Toughness, Forbidden Subgraphs and Pancyclicity. Graphs Comb. 37(3): 839-866 (2021) - [j149]Qiannan Zhou, Hajo Broersma, Ligong Wang, Yong Lu:
Sufficient Spectral Radius Conditions for Hamilton-Connectivity of k-Connected Graphs. Graphs Comb. 37(6): 2467-2485 (2021) - [j148]Ruonan Li, Hajo Broersma, Maho Yokota, Kiyoshi Yoshimoto:
Edge-colored complete graphs without properly colored even cycles: A full characterization. J. Graph Theory 98(1): 110-124 (2021) - [j147]Hans-Christian Ruiz Euler, Unai Alegre Ibarra, Bram van de Ven, Hajo Broersma, Peter A. Bobbert, Wilfred G. van der Wiel:
Dopant network processing units: towards efficient neural network emulators with high-capacity nanoelectronic nodes. Neuromorph. Comput. Eng. 1(2): 24002 (2021) - 2020
- [j146]Wei Zheng, Hajo Broersma, Ligong Wang, Shenggui Zhang:
Conditions on subgraphs, degrees, and domination for hamiltonian properties of graphs. Discret. Math. 343(1): 111644 (2020) - [j145]Tao Tian, Hajo Broersma, Liming Xiong:
On sufficient degree conditions for traceability of claw-free graphs. Discret. Math. 343(7): 111883 (2020) - [j144]Zhiwei Guo, Hajo Broersma, Ruonan Li, Shenggui Zhang:
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs. J. Comb. Optim. 40(4): 1008-1019 (2020) - [j143]Ruonan Li, Hajo Broersma, Shenggui Zhang:
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs. J. Graph Theory 94(3): 476-493 (2020) - [j142]Tao Chen, Jeroen van Gelder, Bram van de Ven, Sergey V. Amitonov, Bram De Wilde, Hans-Christian Ruiz Euler, Hajo Broersma, Peter A. Bobbert, Floris A. Zwanenburg, Wilfred G. van der Wiel:
Classification with a disordered dopant-atom network in silicon. Nat. 577(7790): 341-345 (2020) - [c36]Fengwei Li, Qingfang Ye, Hajo Broersma, Xiaoyan Zhang:
Optimal Algorithm of Isolated Toughness for Interval Graphs. PDCAT 2020: 379-388 - [i3]Hans-Christian Ruiz Euler, Unai Alegre Ibarra, Bram van de Ven, Hajo Broersma, Peter A. Bobbert, Wilfred G. van der Wiel:
Dopant Network Processing Units: Towards Efficient Neural-network Emulators with High-capacity Nanoelectronic Nodes. CoRR abs/2007.12371 (2020)
2010 – 2019
- 2019
- [j141]Antoon Hendrik Boode, Hajo Broersma:
Decompositions of graphs based on a new graph product. Discret. Appl. Math. 259: 31-40 (2019) - [j140]Fengwei Li, Xiaoyan Zhang, Hajo Broersma:
A polynomial algorithm for weighted scattering number in interval graphs. Discret. Appl. Math. 264: 118-124 (2019) - [j139]Ruonan Li, Hajo Broersma, Shenggui Zhang:
Properly Edge-colored Theta Graphs in Edge-colored Complete Graphs. Graphs Comb. 35(1): 261-286 (2019) - 2018
- [j138]Fengwei Li, Hajo Broersma, Juan Rada, Yuefang Sun:
Extremal benzenoid systems for two modified versions of the Randić index. Appl. Math. Comput. 337: 14-24 (2018) - [j137]Binlong Li, Hajo Broersma, Shenggui Zhang:
Conditions for graphs to be path partition optimal. Discret. Math. 341(5): 1350-1358 (2018) - [p2]Zoran Konkoli, Susan Stepney, Hajo Broersma, Paolo Dini, Chrystopher L. Nehaniv, Stefano Nichele:
Philosophy of Computation. Computational Matter 2018: 153-184 - [p1]Hajo Broersma, Susan Stepney, Göran Wendin:
Computability and Complexity of Unconventional Computing Devices. Computational Matter 2018: 185-229 - 2017
- [j136]Ruonan Li, Hajo Broersma, Chuandong Xu, Shenggui Zhang:
Cycle extension in edge-colored complete graphs. Discret. Math. 340(6): 1235-1241 (2017) - [j135]Binlong Li, Yanbo Zhang, Hajo Broersma:
An Exact Formula for all Star-Kipas Ramsey Numbers. Graphs Comb. 33(1): 141-148 (2017) - [j134]Zan-Bo Zhang, Xiaoyan Zhang, Hajo Broersma, Dingjun Lou:
Extremal and Degree Conditions for Path Extendability in Digraphs. SIAM J. Discret. Math. 31(3): 1990-2014 (2017) - [i2]Hajo Broersma, Susan Stepney, Göran Wendin:
Computability and Complexity of Unconventional Computing Devices. CoRR abs/1702.02980 (2017) - 2016
- [j133]Xiaodong Chen, Mingchu Li, Wei Liao, Hajo Broersma:
Hamiltonian properties of almost locally connected claw-free graphs. Ars Comb. 124: 95-109 (2016) - [j132]Yanbo Zhang, Hajo Broersma, Yaojun Chen:
On star-critical and upper size Ramsey numbers. Discret. Appl. Math. 202: 174-180 (2016) - [j131]Yanbo Zhang, Hajo Broersma, Yaojun Chen:
On fan-wheel and tree-wheel Ramsey numbers. Discret. Math. 339(9): 2284-2287 (2016) - [j130]Hajo Broersma, Binlong Li, Shenggui Zhang:
Forbidden subgraphs for hamiltonicity of 1-tough graphs. Discuss. Math. Graph Theory 36(4): 915-929 (2016) - [j129]Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen:
On the complexity of edge-colored subgraph partitioning problems in network optimization. Discret. Math. Theor. Comput. Sci. 17(3): 227-244 (2016) - [c35]Ruud van Damme, Hajo Broersma, Julia Mikhal, Celestine Lawrence, Wilfred G. van der Wiel:
A simulation tool for evolving functionalities in disordered nanoparticle networks. CEC 2016: 5238-5245 - 2015
- [j128]Binlong Li, Yanbo Zhang, Halina Bielak, Hajo Broersma, Premek Holub:
Closing the Gap on Path-Kipas Ramsey Numbers. Electron. J. Comb. 22(3): 3 (2015) - [j127]Yanbo Zhang, Hajo Broersma, Yaojun Chen:
Ramsey numbers of trees versus fans. Discret. Math. 338(6): 994-999 (2015) - [j126]Hajo Broersma:
How tough is toughness? Bull. EATCS 117 (2015) - [j125]Antoon Hendrik Boode, Hajo Broersma, Jan F. Broenink:
On a directed tree problem motivated by a newly introduced graph product. Electron. J. Graph Theory Appl. 3(2): 162-181 (2015) - [j124]Douglas Bauer, Hajo Broersma, Jan van den Heuvel, Nathan Kahl, Aori Nevo, Edward F. Schmeichel, Douglas R. Woodall, Michael Yatauro:
Best Monotone Degree Conditions for Graph Properties: A Survey. Graphs Comb. 31(1): 1-22 (2015) - [j123]Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang:
Characterizing Heavy Subgraph Pairs for Pancyclicity. Graphs Comb. 31(3): 649-667 (2015) - [j122]Yanbo Zhang, Hajo Broersma, Yaojun Chen:
Three Results on Cycle-Wheel Ramsey Numbers. Graphs Comb. 31(6): 2467-2479 (2015) - [j121]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. J. Graph Theory 79(4): 282-299 (2015) - [j120]Limin Wang, Xiaoyan Zhang, Zhao Zhang, Hajo Broersma:
A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs. Theor. Comput. Sci. 571: 58-66 (2015) - [c34]Julian Francis Miller, Hajo Broersma:
Computational Matter: Evolving Computational Solutions in Materials. GECCO (Companion) 2015: 769-770 - 2014
- [j119]Hajo Broersma, Binlong Li, Shenggui Zhang:
Heavy subgraph pairs for traceability of block-chains. Discuss. Math. Graph Theory 34(2): 287-307 (2014) - [j118]Yanbo Zhang, Hajo Broersma, Yaojun Chen:
A remark on star-C4 and wheel-C4 Ramsey numbers. Electron. J. Graph Theory Appl. 2(2): 110-114 (2014) - [j117]Jichang Wu, Hajo Broersma, Haiyan Kang:
Removable Edges and Chords of Longest Cycles in 3-Connected Graphs. Graphs Comb. 30(3): 743-753 (2014) - [j116]Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
On Toughness and Hamiltonicity of 2K2-Free Graphs. J. Graph Theory 75(3): 244-255 (2014) - 2013
- [j115]Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013) - [j114]Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger:
Fully decomposable split graphs. Eur. J. Comb. 34(3): 567-575 (2013) - [j113]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three complexity results on coloring Pk-free graphs. Eur. J. Comb. 34(3): 609-619 (2013) - [j112]Binlong Li, Hajo Broersma, Shenggui Zhang:
Forbidden subgraph pairs for traceability of block-chains. Electron. J. Graph Theory Appl. 1(1): 1-10 (2013) - [j111]Mingchu Li, Lifeng Yuan, He Jiang, Bing Liu, Haitze J. Broersma:
Tank-Ring Factors in Supereulerian Claw-Free Graphs. Graphs Comb. 29(3): 599-608 (2013) - [j110]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Toughness and Vertex Degrees. J. Graph Theory 72(2): 209-219 (2013) - [j109]Hajo Broersma, Petr A. Golovach, Viresh Patel:
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theor. Comput. Sci. 485: 69-84 (2013) - [c33]Robert de Groote, Philip K. F. Hölzenspies, Jan Kuper, Hajo Broersma:
Back to basics: Homogeneous representations of multi-rate synchronous dataflow graphs. MEMOCODE 2013: 35-46 - [c32]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. WG 2013: 127-138 - [c31]Antoon Hendrik Boode, Hajo Broersma, Jan F. Broenink:
Improving the Performance of Periodic Real-time Processes: a Graph Theoretical Approach. CPA 2013: 57-80 - [i1]Hajo Broersma, Jirí Fiala, Petr A. Golovach, Tomás Kaiser, Daniël Paulusma, Andrzej Proskurowski:
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs. CoRR abs/1301.5953 (2013) - 2012
- [j108]Binlong Li, Hajo Broersma, Shenggui Zhang:
Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discret. Math. 312(18): 2800-2818 (2012) - [j107]Haitze J. Broersma, Zdenek Ryjácek, Petr Vrána:
How Many Conjectures Can You Stand? A Survey. Graphs Comb. 28(1): 57-75 (2012) - [j106]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Nathan Kahl, Edward F. Schmeichel:
Degree Sequences and the Existence of k-Factors. Graphs Comb. 28(2): 149-166 (2012) - [j105]Hajo Broersma, Faustino J. Gomez, Julian F. Miller, Mike Petty, Gunnar Tufte:
Nascence Project: Nanoscale Engineering for Novel Computation Using Evolution. Int. J. Unconv. Comput. 8(4): 313-317 (2012) - [j104]Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
The complexity of finding uniform sparsest cuts in various graph classes. J. Discrete Algorithms 14: 136-149 (2012) - [j103]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Updating the complexity status of coloring graphs without a fixed induced linear forest. Theor. Comput. Sci. 414(1): 9-19 (2012) - [j102]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theor. Comput. Sci. 423: 1-10 (2012) - [c30]Robert de Groote, Jan Kuper, Hajo Broersma, Gerard J. M. Smit:
Max-Plus Algebraic Throughput Analysis of Synchronous Dataflow Graphs. EUROMICRO-SEAA 2012: 29-38 - 2011
- [j101]Mingchu Li, Xiaodong Chen, Hajo Broersma:
Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. J. Graph Theory 68(4): 285-298 (2011) - [c29]Hajo Broersma, Petr A. Golovach, Viresh Patel:
Tight Complexity Bounds for FPT Subgraph Problems Parameterized by Clique-Width. IPEC 2011: 207-218 - 2010
- [j100]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 8(2): 101 (2010) - [j99]Hajo Broersma, Daniël Paulusma:
Computing sharp 2-factors in claw-free graphs. J. Discrete Algorithms 8(3): 321-329 (2010) - [c28]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
On Coloring Graphs without Induced Forests. ISAAC (2) 2010: 156-167 - [c27]Paul S. Bonsma, Hajo Broersma, Viresh Patel, Artem V. Pyatkin:
The Complexity Status of Problems Related to Sparsest Cuts. IWOCA 2010: 125-135 - [c26]Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song:
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. WG 2010: 63-74
2000 – 2009
- 2009
- [j98]Xueliang Li, Xiangmei Yao, Wenli Zhou, Hajo Broersma:
Complexity of conditional colorability of graphs. Appl. Math. Lett. 22(3): 320-324 (2009) - [j97]Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto:
lambda-backbone colorings along pairwise disjoint stars and matchings. Discret. Math. 309(18): 5596-5609 (2009) - [j96]Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discuss. Math. Graph Theory 29(1): 143-162 (2009) - [j95]Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto:
Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs. Graphs Comb. 25(4): 427-460 (2009) - [j94]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Editorial. J. Discrete Algorithms 7(2): 147 (2009) - [j93]Hajo Broersma, Elkin Vumar:
On hamiltonicity of P 3-dominated graphs. Math. Methods Oper. Res. 69(2): 297-306 (2009) - [j92]Hajo Broersma, Matthew Johnson, Daniël Paulusma:
Upper bounds and algorithms for parallel knock-out numbers. Theor. Comput. Sci. 410(14): 1319-1327 (2009) - [c25]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma:
Three Complexity Results on Coloring Pk-Free Graphs. IWOCA 2009: 95-104 - [c24]Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger:
Fully Decomposable Split Graphs. IWOCA 2009: 105-112 - [c23]Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. WG 2009: 44-53 - 2008
- [j91]Mingchu Li, Liming Xiong, Haitze J. Broersma:
Connected even factors in claw-free graphs. Discret. Math. 308(11): 2282-2284 (2008) - [j90]Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks. Discret. Math. 308(24): 6064-6077 (2008) - [j89]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Some families of integral graphs. Discret. Math. 308(24): 6383-6391 (2008) - [j88]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Preface. J. Discrete Algorithms 6(4): 539 (2008) - [j87]Hajo Broersma, Agostino Capponi, Daniël Paulusma:
A New Algorithm for On-line Coloring Bipartite Graphs. SIAM J. Discret. Math. 22(1): 72-91 (2008) - [j86]Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The computational complexity of the parallel knock-out problem. Theor. Comput. Sci. 393(1-3): 182-195 (2008) - [c22]Hajo Broersma, Daniël Paulusma:
Computing Sharp 2-Factors in Claw-Free Graphs. MFCS 2008: 193-204 - [e3]Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma:
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Lecture Notes in Computer Science 5344, 2008, ISBN 978-3-540-92247-6 [contents] - 2007
- [j85]Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic, Gerhard J. Woeginger:
Eliminating graphs by means of parallel knock-out schemes. Discret. Appl. Math. 155(2): 92-102 (2007) - [j84]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Integral trees of diameter 6. Discret. Appl. Math. 155(10): 1254-1266 (2007) - [j83]Douglas Bauer, Hajo Broersma, Nathan Kahl, Aurora Morgana, Edward F. Schmeichel, Thomas M. Surowiec:
Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discret. Appl. Math. 155(10): 1336-1343 (2007) - [j82]A. N. M. Salman, Haitze J. Broersma:
Path-kipas Ramsey numbers. Discret. Appl. Math. 155(14): 1878-1884 (2007) - [j81]Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto:
Toughness and hamiltonicity in k-trees. Discret. Math. 307(7-8): 832-838 (2007) - [j80]A. N. M. Salman, Hajo Broersma:
On Ramsey numbers for paths versus wheels. Discret. Math. 307(7-8): 975-982 (2007) - [j79]Hajo Broersma, Gasper Fijavz, Tomás Kaiser, Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electron. Notes Discret. Math. 28: 55-59 (2007) - [j78]Hajo Broersma, Daniël Paulusma, Kiyoshi Yoshimoto:
On components of 2-factors in claw-free graphs. Electron. Notes Discret. Math. 29: 289-293 (2007) - [j77]Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, Jan van den Heuvel:
A new upper bound on the cyclic chromatic number. J. Graph Theory 54(1): 58-72 (2007) - [j76]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone colorings for graphs: Tree and path backbones. J. Graph Theory 55(2): 137-152 (2007) - [j75]Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Tutte sets in graphs I: Maximal tutte sets and D-graphs. J. Graph Theory 55(4): 343-358 (2007) - [j74]Hajo Broersma, Xueliang Li:
On the complexity of dominating set problems related to the minimum all-ones problem. Theor. Comput. Sci. 385(1-3): 60-70 (2007) - [c21]Hajo Broersma, Matthew Johnson, Daniël Paulusma:
Upper Bounds and Algorithms for Parallel Knock-Out Numbers. SIROCCO 2007: 328-340 - [c20]Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. SOFSEM (1) 2007: 188-199 - 2006
- [j73]Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica 44(4): 343-361 (2006) - [j72]Stephan Brandt, Hajo Broersma, Reinhard Diestel, Matthias Kriesell:
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Comb. 26(1): 17-36 (2006) - [j71]A. N. M. Salman, Hajo Broersma:
Path-fan Ramsey numbers. Discret. Appl. Math. 154(9): 1429-1436 (2006) - [j70]Liming Xiong, Hajo Broersma:
Subpancyclicity of line graphs and degree sums along paths. Discret. Appl. Math. 154(9): 1453-1463 (2006) - [j69]Douglas Bauer, Hajo Broersma, Edward F. Schmeichel:
Toughness in Graphs - A Survey. Graphs Comb. 22(1): 1-35 (2006) - [c19]Hajo Broersma, Agostino Capponi, Daniël Paulusma:
On-Line Coloring of H-Free Bipartite Graphs. CIAC 2006: 284-295 - [c18]Hajo Broersma, Matthew Johnson, Daniël Paulusma, Iain A. Stewart:
The Computational Complexity of the Parallel Knock-Out Problem. LATIN 2006: 250-261 - [e2]Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider:
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK. Texts in Algorithmics 7, King's College, London 2006, ISBN 1-904987-38-9 [contents] - 2005
- [j68]Hajo Broersma, Xueliang Li, Gerhard J. Woeginger, Shenggui Zhang:
Paths and cycles in colored graphs. Australas. J Comb. 31: 299-312 (2005) - [j67]Liming Xiong, Zdenek Ryjácek, Hajo Broersma:
On stability of the hamiltonian index under contractions and closures. J. Graph Theory 49(2): 104-115 (2005) - [e1]Hajo Broersma, Matthew Johnson, Stefan Szeider:
Algorithms and Complexity in Durham 2005 - Proceedings of the First ACiD Workshop, 8-10 July 2005, Durham, UK. Texts in Algorithmics 4, King's College, London 2005, ISBN 1-904987-10-9 [contents] - 2004
- [j66]Ulrich Faigle, Stefan Pickl, Hajo Broersma, Johann L. Hurink:
Preface: The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Discret. Appl. Math. 136(2-3): 159-160 (2004) - [j65]Liming Xiong, Hajo Broersma, Xueliang Li, Mingchu Li:
The hamiltonian index of a graph and its branch-bonds. Discret. Math. 285(1-3): 279-288 (2004) - [j64]A. N. M. Salman, Haitze J. Broersma:
The Ramsey Numbers of Paths Versus Kipases. Electron. Notes Discret. Math. 17: 251-255 (2004) - [j63]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Preassigned Frequencies. SIAM J. Optim. 15(1): 1-16 (2004) - [c17]A. N. M. Salman, Hajo Broersma:
The Ramsey Numbers of Paths Versus Kipases. CTW 2004: 218-222 - [c16]Lodewijk T. Smit, Gerard J. M. Smit, Johann L. Hurink, Hajo Broersma, Daniël Paulusma, Pascal T. Wolkotte:
Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. FPT 2004: 421-424 - [c15]Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger:
Parallel Knock-Out Schemes in Networks. MFCS 2004: 204-214 - [c14]Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger:
The Computational Complexity of the Minimum Weight Processor Assignment Problem. WG 2004: 189-200 - 2003
- [j62]A. N. M. Salman, Haitze J. Broersma:
The Ramsey Numbers of Paths Versus Fans. Electron. Notes Discret. Math. 13: 103-107 (2003) - [j61]Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl, Gerhard J. Woeginger:
Preface: Volume 13. Electron. Notes Discret. Math. 13: 128 (2003) - [j60]A. N. M. Salman, Hajo Broersma, Edy Tri Baskoro:
Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs. J. Autom. Lang. Comb. 8(4): 675-681 (2003) - [c13]Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Michèl A. J. Rosien, Paul M. Heysters:
Mapping Applications to a Coarse Grain Reconfigurable System. Asia-Pacific Computer Systems Architecture Conference 2003: 221-235 - [c12]Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters:
Template Generation and Selection Algorithms. IWSOC 2003: 2-6 - [c11]Hajo Broersma:
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems. IJCCGGT 2003: 65-79 - [c10]Surahmat, Edy Tri Baskoro, Saladin Uttunggadewa, Hajo Broersma:
An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels. IJCCGGT 2003: 181-184 - [c9]Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters:
A graph covering algorithm for a coarse grain reconfigurable system. LCTES 2003: 199-208 - [c8]Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger:
Backbone Colorings for Networks. WG 2003: 131-142 - 2002
- [j59]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems. Algorithmica 32(4): 594-610 (2002) - [j58]Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More About Subcolorings. Computing 69(3): 187-203 (2002) - [j57]Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discret. Appl. Math. 120(1-3): 13-23 (2002) - [j56]Hajo Broersma, Liming Xiong:
A note on minimum degree conditions for supereulerian graphs. Discret. Appl. Math. 120(1-3): 35-43 (2002) - [j55]Hajo Broersma, Xueliang Li:
Some approaches to a conjecture on short cycles in digraphs. Discret. Appl. Math. 120(1-3): 45-53 (2002) - [j54]Liming Xiong, Hajo Broersma, Cornelis Hoede, Xueliang Li:
Degree sums and subpancyclicity in line graphs. Discret. Math. 242(1-3): 255-267 (2002) - [j53]Hajo Broersma:
On some intriguing problems in hamiltonian graph theory--a survey. Discret. Math. 251(1-3): 47-69 (2002) - [j52]J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman:
Heavy cycles in weighted graphs. Discuss. Math. Graph Theory 22(1): 7-15 (2002) - [j51]Hajo Broersma, Xueliang Li:
Isomorphisms and traversability of directed path graphs. Discuss. Math. Graph Theory 22(2): 215-228 (2002) - [j50]Douglas Bauer, Hajo Broersma, Edward F. Schmeichel:
More Progress on Tough Graphs - The Y2K Report. Electron. Notes Discret. Math. 11: 63-80 (2002) - [j49]Shenggui Zhang, Hajo Broersma, Xueliang Li, Ligong Wang:
A Fan Type Condition For Heavy Cycles in Weighted Graphs. Graphs Comb. 18(1): 193-200 (2002) - [j48]Hajo Broersma, Ralph J. Faudree, Andreas Huck, Huib Trommel, Henk Jan Veldman:
Forbidden subgraphs that imply hamiltonian-connectedness. J. Graph Theory 40(2): 104-119 (2002) - [c7]Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger:
Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222 - [c6]Hajo Broersma, Fedor V. Fomin, Jan Kratochvíl, Gerhard J. Woeginger:
Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous. SWAT 2002: 160-169 - [c5]Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger:
More about Subcolorings. WG 2002: 68-79 - 2001
- [j47]Hajo Broersma, Zdenek Ryjácek:
Strengthening the closure concept in claw-free graphs. Discret. Math. 233(1-3): 55-63 (2001) - [j46]Hajo Broersma, Xueliang Li, Shenggui Zhang:
A σ3 type condition for heavy cycles in weighted graphs. Discuss. Math. Graph Theory 21(2): 159-166 (2001) - [j45]Hajo Broersma, Ulrich Faigle, Johann L. Hurink, Stefan Pickl:
Preface: Volume 8. Electron. Notes Discret. Math. 8: 1 (2001) - [j44]Xueliang Li, Shenggui Zhang, Hajo Broersma:
Paths and Cycles in Colored Graphs. Electron. Notes Discret. Math. 8: 128-132 (2001) - [j43]Haitze J. Broersma, Matthias Kriesell, Zdenek Ryjácek:
On factors of 4-connected claw-free graphs. J. Graph Theory 37(2): 125-136 (2001) - 2000
- [j42]Douglas Bauer, Hajo Broersma, Henk Jan Veldman:
Not Every 2-tough Graph Is Hamiltonian. Discret. Appl. Math. 99(1-3): 317-321 (2000) - [j41]Hajo Broersma, Elias Dahlhaus, Ton Kloks:
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs. Discret. Appl. Math. 99(1-3): 367-400 (2000) - [j40]Shenggui Zhang, Xueliang Li, Hajo Broersma:
Heavy paths and cycles in weighted graphs. Discret. Math. 223(1-3): 327-336 (2000) - [j39]Hajo Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Closure Concepts: A Survey. Graphs Comb. 16(1): 17-48 (2000) - [j38]Hajo Broersma, Otto R. Koppius, Hilde Tuinstra, Andreas Huck, Ton Kloks, Dieter Kratsch, Haiko Müller:
Degree-preserving trees. Networks 35(1): 26-39 (2000)
1990 – 1999
- 1999
- [j37]Hajo Broersma, Cornelis Hoede:
Another equivalent of the graceful tree conjecture. Ars Comb. 51 (1999) - [j36]Hajo Broersma, Erik Engbers, Huib Trommel:
Various results on the toughness of graphs. Networks 33(3): 233-238 (1999) - [j35]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
Independent Sets in Asteroidal Triple-Free Graphs. SIAM J. Discret. Math. 12(2): 276-287 (1999) - 1998
- [j34]Hajo Broersma, Huib Trommel:
Closure concepts for claw-free graphs. Discret. Math. 185(1-3): 231-238 (1998) - [j33]Hajo Broersma, Hilde Tuinstra:
Independence trees and Hamilton cycles. J. Graph Theory 29(4): 227-237 (1998) - [c4]Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra:
Degree-Preserving Forests. MFCS 1998: 713-721 - [c3]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking. WG 1998: 88-99 - 1997
- [j32]Haitze J. Broersma:
A note on the minimum size of a vertex pancyclic graph. Discret. Math. 164(1-3): 29-32 (1997) - [j31]Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Dirac's minimum degree condition restricted to claws. Discret. Math. 167-168: 155-166 (1997) - [j30]Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz:
Spanning trees with pairwise nonadjacent endvertices. Discret. Math. 170(1-3): 219-222 (1997) - [j29]Hajo Broersma, Hao Li, Jianping Li, Feng Tian, Henk Jan Veldman:
Cycles through subsets with large degree sums. Discret. Math. 171(1-3): 43-54 (1997) - [j28]Hajo Broersma, Xueliang Li:
Spanning trees with many or few colors in edge-colored graphs. Discuss. Math. Graph Theory 17(2): 259-269 (1997) - [c2]Hajo Broersma, Ton Kloks, Dieter Kratsch, Haiko Müller:
Independent Sets in Asteroidal Triple-Free Graphs. ICALP 1997: 760-770 - [c1]Hajo Broersma, Elias Dahlhaus, Ton Kloks:
Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. WG 1997: 109-117 - 1996
- [j27]Hajo Broersma, Xueliang Li:
The connectivity of the leaf-exchange spanning tree graph of a graph. Ars Comb. 43 (1996) - [j26]Armen S. Asratian, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
On graphs satisfying a local ore-type condition. J. Graph Theory 21(1): 1-10 (1996) - [j25]Haitze J. Broersma, Zdenek Ryjácek, Ingo Schiermeyer:
Toughness and hamiltonicity in almost claw-free graphs. J. Graph Theory 21(4): 431-439 (1996) - [j24]Haitze J. Broersma, Jan van den Heuvel, Bill Jackson, Henk Jan Veldman:
Hamiltonicity of regular 2-connected graphs. J. Graph Theory 22(2): 105-124 (1996) - [j23]Thomas Böhme, Haitze J. Broersma, Henk Jan Veldman:
Toughness and longest cycles in 2-connected planar graphs. J. Graph Theory 23(3): 257-263 (1996) - 1995
- [j22]Douglas Bauer, Haitze J. Broersma, Henk Jan Veldman:
On generalizing a theorem of Jung. Ars Comb. 40 (1995) - [j21]Douglas Bauer, Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. 141(1-3): 1-10 (1995) - [j20]Haitze J. Broersma, M. Lu:
Cycles through particular subgraphs of claw-free graphs. J. Graph Theory 20(4): 459-465 (1995) - [j19]Haitze J. Broersma, F. Göbel:
Bipartite regular graphs with fixed diameter. Networks 26(3): 139-144 (1995) - 1994
- [j18]Hajo Broersma, Ingo Schiermeyer:
Subgraphs, Closures and Hamiltonicity. Discret. Appl. Math. 51(1-2): 39-46 (1994) - [j17]Haitze J. Broersma, Ingo Schiermeyer:
A closure concept based on neighborhood unions of independent triples. Discret. Math. 124(1-3): 37-47 (1994) - 1993
- [j16]Hajo Broersma, Xueliang Li:
On "The Matching Polynomial of a Polygraph". Discret. Appl. Math. 46(1): 79-86 (1993) - [j15]Haitze J. Broersma, F. Göbel:
Coloring a graph optimally with two colors. Discret. Math. 118(1-3): 23-31 (1993) - [j14]Haitze J. Broersma:
A note on K4-closures in hamiltonian graph theory. Discret. Math. 121(1-3): 19-23 (1993) - [j13]Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
Long cycles, degree sums and neighborhood unions. Discret. Math. 121(1-3): 25-35 (1993) - [j12]Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
A generalization of Ore's Theorem involving neighborhood unions. Discret. Math. 122(1-3): 37-49 (1993) - [j11]Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
Long paths and cycles in tough graphs. Graphs Comb. 9(1): 3-17 (1993) - [j10]Haitze J. Broersma, Jan van den Heuvel, Heinz Adolf Jung, Henk Jan Veldman:
Cycles containing all vertices of maximum degree. J. Graph Theory 17(3): 373-385 (1993) - [j9]Haitze J. Broersma, A. J. W. Duijvestijn, F. Göbel:
Generating all 3-connected 4-regular planar graphs from the octahedron graph. J. Graph Theory 17(5): 613-620 (1993) - [j8]Haitze J. Broersma, Ralph J. Faudree, Jan van den Heuvel, Henk Jan Veldman:
Decomposition of bipartite graphs under degree constraints. Networks 23(3): 159-164 (1993) - 1992
- [j7]Haitze J. Broersma, Xueliang Li:
The connectivity of the basis graph of a branching greedoid. J. Graph Theory 16(3): 233-237 (1992) - [j6]Haitze J. Broersma, Andy Liu, L. V. Saxton:
An Affirmative Action Graph (D. J. Newman). SIAM Rev. 34(4): 652-653 (1992) - 1991
- [j5]Haitze J. Broersma, Henk Jan Veldman:
Long dominating cycles and paths in graphs with large neighborhood unions. J. Graph Theory 15(1): 29-38 (1991)
1980 – 1989
- 1989
- [j4]Douglas Bauer, Hajo Broersma, Henk Jan Veldman, Li Rao:
A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory B 47(2): 237-243 (1989) - [j3]Haitze J. Broersma, Cornelis Hoede:
Path graphs. J. Graph Theory 13(4): 427-444 (1989) - 1988
- [j2]Haitze J. Broersma:
Existence of Δλ-cycles and Δλ-paths. J. Graph Theory 12(4): 499-507 (1988) - 1987
- [j1]Haitze J. Broersma, Henk Jan Veldman:
3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11(3): 399-407 (1987)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-08 14:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
