EEMCS

Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Search
 Organisation

EEMCS EPrints Service


Classification: MSC-05C
Home Policy Brochure Browse Search User Area Contact Help

2017

Li, Binlong and Zhang, Yanbo and Broersma, H.J. (2017) An exact formula for all star-kipas Ramsey numbers. Graphs and combinatorics, 33 (1). pp. 141-148. ISSN 0911-0119 *** ISI Impact 0,480 ***

2016

Chen, Xiaodong and Li, MingChu and Liao, Wei and Broersma, H.J. (2016) Hamiltonian properties of almost locally connected claw-free graphs. Ars combinatoria, 124. pp. 95-109. ISSN 0381-7032 *** ISI Impact 0,265 ***
Zhang, Xiaoyan and Zhang, Zan-Bo and Broersma, H.J. and Wen, Xuelian (2016) On the complexity of edge-colored subgraph partitioning problems in network optimization. Discrete mathematics and theoretical computer science, 17 (3). pp. 227-244. ISSN 1365-8050
Zhang, Yanbo and Broersma, H.J. and Chen, Y. (2016) On star-critical and upper size Ramsey numbers. Discrete applied mathematics, 202. pp. 174-180. ISSN 0166-218X *** ISI Impact 0,722 ***
Zhang, Yanbo and Broersma, H.J. and Chen, Y. (2016) Narrowing down the gap on cycle-star Ramsey numbers. Journal of combinatorics, 7 (2-3). pp. 481-493. ISSN 2156-3527
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2016) On fan-wheel and tree-wheel Ramsey numbers. Discrete mathematics, 339 (9). pp. 2284-2287. ISSN 0012-365X *** ISI Impact 0,600 ***

2015

Bauer, D. and Broersma, H.J. and van den Heuvel, J. and Kahl, N. and Nevo, A. and Schmeichel, E. and Woodall, D.R. and Yatauro, M. (2015) Best monotone degree conditions for graph properties: a survey. Graphs and combinatorics, 31 (1). pp. 1-22. ISSN 0911-0119 *** ISI Impact 0,480 ***
Broersma, H.J. (2015) How tough is toughness? Bulletin of the European Association for Theoretical Computer Science, 117. pp. 28-52. ISSN 0252-9742
Broersma, H.J. and Fiala, J. and Golovach, P.A. and Kaiser, T. and Paulusma, D. and Proskurowski, A. (2015) Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs. Journal of graph theory, 79 (4). pp. 282-299. ISSN 0364-9024 *** ISI Impact 0,796 ***
Li, Binlong and Ning, B0 and Broersma, H.J. and Zhang, Shenggui (2015) Characterizing heavy subgraph pairs for pancyclicity. Graphs and combinatorics, 31 (3). pp. 649-667. ISSN 0911-0119 *** ISI Impact 0,480 ***
Li, Binlong and Zhang, Yanbo and Bielak, H. and Broersma, H.J. and Holub, P. (2015) Closing the gap on path-kipas Ramsey numbers. Electronic journal of combinatorics, 22 (3). 3.21. ISSN 1077-8926 *** ISI Impact 0,612 ***
Wang, Limin and Zhang, Xiaoyan and Zhang, Zhao and Broersma, H.J. (2015) A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs. Theoretical computer science, 571. pp. 58-66. ISSN 0304-3975 *** ISI Impact 0,643 ***
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2015) Ramsey numbers of trees versus fans. Discrete mathematics, 338 (6). pp. 994-999. ISSN 0012-365X *** ISI Impact 0,600 ***
Zhang, Yanbo (2015) Generalized Ramsey numbers for graphs. PhD thesis, Univ. of Twente. CTIT Ph.D.-thesis series No. 15-345 ISBN 978-90-365-3832-9
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2015) Three results on cycle-wheel Ramsey numbers. Graphs and combinatorics, 31 (6). pp. 2467-2479. ISSN 0911-0119 *** ISI Impact 0,480 ***
Zhang, Yanbo and Broersma, H.J. and Chen, Yaojun (2015) A note on Ramsey numbers for fans. Bulletin of the Australian Mathematical Society, 92 (1). pp. 19-23. ISSN 0004-9727 *** ISI Impact 0,566 ***

2014

Broersma, H.J. and Patel, V. and Pyatkin, A. (2014) On toughness and hamiltonicity of 2K2-free graphs Journal of graph theory, 75 (3). pp. 244-255. ISSN 0364-9024 *** ISI Impact 0,796 ***
Zhang, Xiaoyan (2014) Algorithmic and structural aspects of graph partitioning and related problems. PhD thesis, Univ. of Twente. CTIT Ph.D.-thesis series No. 14-329 ISBN 978-90-365-3626-4

2013

Bauer, D. and Broersma, H.J. and van den Heuvel, J. and Kahl, N. and Schmeichel , E. (2013) Toughness and vertex degrees. Journal of graph theory, 72 (2). pp. 209-219. ISSN 0364-9024 *** ISI Impact 0,796 ***
Broersma, H.J. and Fiala, J. and Golovach, P.A. and Kaiser, T. and Paulusma, D. and Proskurowski, A. (2013) Linear-time algorithms for scattering number and hamilton-connectivity of interval graphs. In: 39th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2013, 19-21 Jun 2013, Lübeck, Germany. pp. 127-138. Lecture Notes in Computer Science 8165. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-45042-6
Broersma, H.J. and Fomin, F.V. and van 't Hof, P. and Paulusma, D. (2013) Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica, 65 (1). pp. 129-145. ISSN 0178-4617 *** ISI Impact 0,795 ***
Broersma, H.J. and Fomin, V.F. and Golovach, P.A. and Paulusma, D. (2013) Three complexity results on coloring $P_k$-free graphs. European journal of combinatorics, 34 (3). pp. 609-619. ISSN 0195-6698 *** ISI Impact 0,650 ***
Broersma, H.J. and Golovach, P.A. and Patel, V. (2013) Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theoretical computer science, 485. pp. 69-84. ISSN 0304-3975 *** ISI Impact 0,643 ***
Broersma, H.J. and Kratsch, D. and Woeginger, G.J. (2013) Fully decomposable split graphs. European journal of combinatorics, 34 (3). pp. 567-575. ISSN 0195-6698 *** ISI Impact 0,650 ***
Li, MingChu and Yuan, Lifeng and Jiang, He and Liu, Bing and Broersma, H.J. (2013) Tank-ring factors in supereulerian claw-free graphs. Graphs and combinatorics, 29 (3). pp. 599-608. ISSN 0911-0119 *** ISI Impact 0,480 ***

2012

Bauer, D. and Broersma, H.J. and van den Heuvel, J. and Kahl, N. and Schmeichel, E. (2012) Degree sequences and the existence of k-factors. Graphs and combinatorics, 28 (2). pp. 149-166. ISSN 0911-0119 *** ISI Impact 0,480 ***
Bonsma, P.S. and Broersma, H.J. and Patel, V. and Pyatkin, A. (2012) The complexity of finding uniform sparsest cuts in various graph classes. Journal of discrete algorithms, 14. pp. 136-149. ISSN 1570-8667
Broersma, H.J. and Golovach, P.A. and Paulusma, D. and Song, J. (2012) Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theoretical computer science, 423. pp. 1-10. ISSN 0304-3975 *** ISI Impact 0,643 ***
Broersma, H.J. and Golovach, P.A. and Paulusma, D. and Song, Jian (2012) Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoretical computer science, 414 (1). pp. 9-19. ISSN 0304-3975 *** ISI Impact 0,643 ***
Li, Binlong and Broersma, H.J. and Zhang, Shenggui (2012) Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discrete mathematics, 312 (18). pp. 2800-2818. ISSN 0012-365X *** ISI Impact 0,600 ***

2011

Bonsma, P.S. and Broersma, H.J. and Patel, V. and Pyatkin, A. (2011) The complexity status of problems related to sparsest cuts. In: Proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, 26-28 July 2010, London, UK. pp. 125-135. Lecture Notes in Computer Science 6460. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-19221-0
Li, MingChu and Chen, Xiaodong and Broersma, H.J. (2011) Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Journal of graph theory, 68 (4). pp. 285-298. ISSN 0364-9024 *** ISI Impact 0,796 ***