Author Publications

Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Jump to: 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1989 | 1988 | 1987
Number of items: 160.

2014

Broersma, Hajo and Patel, Viresh and Pyatkin, Artem (2014) On toughness and hamiltonicity of 2K2-free graphs. Journal of graph theory, 75 (3). pp. 244-255. ISSN 0364-9024

Li, Binlong and Broersma, Hajo and Zhang, Shenggui (2014) Heavy subgraph pairs for traceability of block-chains. Discussiones Mathematicae Graph Theory, 34 (2). pp. 287-307. ISSN 1234-3099

Wu, Jichang and Broersma, Hajo and Kang, Haiyan (2014) Removable edges and chords of longest cycles in 3-connected graphs. Graphs and Combinatorics, 30 (3). pp. 743-753. ISSN 0911-0119

2013

Bauer, D. and Broersma, H.J. and Heuvel, J. van den and Kahl, N. and Schmeichel, E. (2013) Toughness and vertex degrees. Journal of graph theory, 72 (2). pp. 209-219. ISSN 0364-9024

Boode, Antoon H. and Broersma, Hajo and Broenink, Jan F. (2013) Improving the performance of periodic real-time processes: a graph theoretical approach. In: Communicating Process Architectures 2013, 25-28 August 2013, Edinburgh, UK (pp. pp. 57-79).

Broersma, Hajo and Fiala, Jiri and Golovach, Petr A. and Kaiser, Tomas and Paulusma, Daniël and Proskurowski, Andrzej (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 June 2013, Lübeck, Germany (pp. pp. 127-138).

Broersma, Hajo and Fomin, Fedor V. and Hof, Pim van 't and Paulusma, Daniël (2013) Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica, 65 (1). pp. 129-145. ISSN 0178-4617

Broersma, Hajo and Fomin, Vedor V. and Golovach, Petr A. and Paulusma, Daniël (2013) Three complexity results on coloring $P_k$-free graphs. European journal of combinatorics, 34 (3). pp. 609-619. ISSN 0195-6698

Broersma, Hajo and Golovach, Petr A. and Patel, Viresh (2013) Tight complexity bounds for FPT subgraph problems parameterized by the clique-width. Theoretical computer science, 485 . pp. 69-84. ISSN 0304-3975

Broersma, Hajo and Kratsch, Dieter and Woeginger, Gerhard J. (2013) Fully decomposable split graphs. European journal of combinatorics, 34 (3). pp. 567-575. ISSN 0195-6698

Groote, Robert de and Hölzenspies, Philip K.F. and Kuper, Jan and Broersma, Hajo (2013) Back to basics: homogeneous representations of multi-rate synchronous dataflow graphs. In: 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2013, 18-20 October 2013, Portland, OR, USA (pp. pp. 35-46).

Li, Binlong and Broersma, Hajo and Zhang, Shenggui (2013) Forbidden subgraph pairs for traceability of block-chains. Electronic journal of graph theory and applications, 1 (1). pp. 1-10. ISSN 2338-2287

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

2012

Bauer, D. and Broersma, H.J. and Heuvel, J. van den 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

Bonsma, P.S. and Broersma, H.J. and Patel, Viresh and Pyatkin, A.V. (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, 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

Broersma, H.J. and Ryjáček, Z. and Vrána, P. (2012) How many conjectures can you stand: a survey. Graphs and Combinatorics, 28 (1). pp. 57-75. ISSN 0911-0119

Broersma, Hajo and Golovach, Petr A. and Patel, Viresh (2012) Tight complexity bounds for FPT subgraph problems parameterized by clique-width. In: 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, 6-8 September 2011, Saarbrücken, Germany (pp. pp. 207-218).

Broersma, Hajo and Golovach, Petr A. and Paulusma, Daniël and Song, Jian (2012) Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time. Theoretical computer science, 423 . pp. 1-10. ISSN 0304-3975

Broersma, Hajo and Gomez, Faustino and Miller, Julian and Petty, Mike and Tufte, Gunnar (2012) Nascence project: nanoscale engineering for novel computation using evolution. International journal of unconventional computing, 8 (4). pp. 313-317. ISSN 1548-7199

Broersma, Hajo and Golovach, Petr A. and Patel, Viresh (2012) Tight complexity bounds for FPT subgraph problems parameterized by clique-width. In: 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, 6-8 September 2011, Saarbrücken, Germany (pp. pp. 207-218).

Groote, Robert de and Kuper, Jan and Broersma, Hajo and Smit, Gerard J.M. (2012) Max-plus algebraic throughput analysis of synchronous dataflow graphs. In: 38th EUROMICRO Conference on Software Engineering and Advanced Applications, SEAA 2012, 5-8 September 2012, Cesme, Izmir, Turkey (pp. pp. 29-38).

Li, Binlong and Broersma, Hajo and Zhang, Shenggui (2012) Pairs of forbidden induced subgraphs for homogeneously traceable graphs. Discrete mathematics, 312 (18). pp. 2800-2818. ISSN 0012-365X

2011

Bonsma, Paul and Broersma, Hajo and Patel, Viresh and Pyatkin, Artem (2011) The complexity status of problems related to sparsest cuts. In: 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, 26-28 July 2010, London, UK (pp. pp. 125-135).

Li, MingChu and Chen, Xiaodong and Broersma, Hajo (2011) Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs. Journal of Graph Theory, 68 (4). pp. 285-298. ISSN 0364-9024

2010

Broersma, Hajo and Fomin, Fedor V. and Hof, Pim van 't and Paulusma, Daniël (2010) Fast exact algorithms for hamiltonicity in claw-free graphs. In: 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, 24-26 June 2009, Montpellier, France (pp. pp. 44-53).

Broersma, Hajo and Paulusma, Daniël (2010) Computing sharp 2-factors in claw-free graphs. Journal of Discrete Algorithms, 8 (3). pp. 321-329. ISSN 1570-8667

2009

Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2009) Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number. Discussiones Mathematicae Graph Theory, 29 (1). pp. 143-162. ISSN 1234-3099

Broersma, Hajo and Fomin, Fedor V. and Golovach, Petr A. and Paulusma, Daniël (2009) Three complexity results on coloring $P_k$-free graphs. In: 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, June 28 - July 2 2009, Hradec nad Moravicí, Czech Republic (pp. pp. 95-104).

Broersma, Hajo and Kratsch, Dieter and Woeginger, Gerhard J. (2009) Fully decomposable split graphs. In: 20th International Workshop on Combinatorial Algorithms, IWOCA 2009, June 28 - July 2 2009, Hradec nad Moravicí, Czech Republic (pp. pp. 105-112).

Broersma, H.J. and Fujisawa, J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. and Yoshimoto, K. (2009) λ-backbone colorings along pairwise disjoint stars and matchings. Discrete Mathematics, 309 (18). pp. 5596-5609. ISSN 0012-365X

Broersma, H.J. and Vumar, E. (2009) On hamiltonicity of $P_3$-dominated graphs. Mathematical methods of operations research, 69 (2). pp. 297-306. ISSN 1432-2994

Broersma, Hajo and Johnson, Matthew and Paulusma, Daniël and Stewart, Iain A. (2009) Upper bounds and algorithms for parallel knock-out numbers. Theoretical Computer Science, 410 (14). pp. 1319-1327. ISSN 0304-3975

Broersma, Hajo and Paulusma, Daniël and Yoshimoto, Kiyoshi (2009) Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs. Graphs and Combinatorics, 25 (4). pp. 427-460. ISSN 0911-0119

Li, Xueliang and Yao, Xiangmei and Zhou, Wenli and Broersma, Hajo (2009) Complexity of conditional colorability of graphs. Applied Mathematics Letters, 22 (3). pp. 320-324. ISSN 0893-9659

2008

Broersma, H.J. and Paulusma, D. (2008) Computing sharp 2-factors in claw-free graphs. In: 33rd International Symposium on Mathematical Foundations of Computer Science, August 27-31, 2008, Torun, Poland (pp. pp. 193-204).

Broersma, H.J. and Capponi, A. and Paulusma, D. (2008) A new algorithm for on-line coloring bipartite graphs. SIAM Journal on Discrete Mathematics, 22 (1). pp. 72-91. ISSN 0895-4801

Broersma, H.J. and Johnson, M. and Paulusma, D. and Stewart, I.A. (2008) The computational complexity of the parallel knock-out problem. Theoretical Computer Science, 393 (1-3). pp. 182-195. ISSN 0304-3975

Broersma, Hajo and Fijavz, Gasper and Kaiser, Tomas and Kuzel, Roman and Ryjacek, Zdenek and Vrana, Petr (2008) Contractible subgraphs, Thomassen’s conjecture and the dominating cycle conjecture for snarks. Discrete Mathematics, 308 (24). pp. 6064-6077. ISSN 0012-365X

Li, M.C. and Xiong, L. and Broersma, H.J. (2008) Connected even factors in claw-free graphs. Discrete Mathematics, 308 (11). pp. 2282-2284. ISSN 0012-365X

Wang, Ligong and Broersma, Hajo and Hoede, Cornelis and Li, Xueliang and Still, Georg (2008) Some families of integral graphs. Discrete Mathematics, 308 (24). pp. 6383-6391. ISSN 0012-365X

2007

Bauer, D. and Broersma, H.J. and Kahl, N. and Morgana, A. and Schmeichel, E. and Surowiec, T. (2007) Tutte sets in graphs II: The complexity of finding maximum Tutte sets. Discrete Applied Mathematics, 155 (10). pp. 1336-1343. ISSN 0166-218X

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (2007) Tutte sets in graphs I: Maximal tutte sets and D-graphs. Journal of Graph Theory, 55 (4). pp. 343-358. ISSN 0364-9024

Broersma, H.J. and Fomin, F.V. and Královič, R. and Woeginger, G.J. (2007) Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics, 155 (2). pp. 92-102. ISSN 0166-218X

Broersma, H.J. and Marchal, L. and Paulusma, D. and Salman, A.N.M. (2007) Improved upper bounds for $\lambda$-backbone colorings along matchings and stars. In: Proceedings of SOFSEM 2007: Theory and Practice of Computer Science, 20-26 Jan 2007, Harrachov, Czech Republic (pp. pp. 188-199).

Broersma, H.J. and Paulusma, D. and Yoshimoto, K. (2007) On components of 2-factors in claw-free graphs. In: EuroComb 2007: European Conference on Combinatorics, Graph Theory and Applications, 11-15 September 2007, Seville, Spain (pp. pp. 289-293).

Broersma, H.J. and Xiong, L. and Yoshimoto, K. (2007) Toughness and hamiltonicity in k-trees. Discrete Mathematics, 307 (7-8). pp. 832-838. ISSN 0012-365X

Broersma, Hajo and Fijavz, Gasper and Kaiser, Tomas and Kuzel, Roman and Ryjacek, Zdenek and Vrana, Petr (2007) Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks. Electronic Notes in Discrete Mathematics, 28 . pp. 55-59. ISSN 1571-0653

Broersma, Hajo and Fomin, Fedor V. and Golovach, Petr A. and Woeginger, Gerhard J. (2007) Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory, 55 (2). pp. 137-152. ISSN 0364-9024

Broersma, Hajo and Johnson, Matthew and Paulusma, Daniël (2007) Upper bounds and algorithms for parallel knock-out numbers. In: 14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007, 5-8 June 2007, Castiglioncello, Italy (pp. pp. 328-340).

Broersma, Hajo and Li, Xueliang (2007) On the complexity of dominating set problems related to the minimum all-ones problem. Theoretical Computer Science, 385 (1-3). pp. 60-70. ISSN 0304-3975

Salman, A.N.M. and Broersma, H.J. (2007) On Ramsey numbers for paths versus wheels. Discrete Mathematics, 307 (7-8). pp. 975-982. ISSN 0012-365X

Salman, A.N.M. and Broersma, H.J. (2007) Path–kipas Ramsey numbers. Discrete Applied Mathematics, 155 (14). pp. 1878-1884. ISSN 0166-218X

Wang, L. and Broersma, H.J. and Hoede, C. and Li, X. and Still, G.J. (2007) Integral trees of diameter 6. Discrete Applied Mathematics, 155 (10). pp. 1254-1266. ISSN 0166-218X

2006

Bauer, Douglas and Broersma, Hajo and Schmeichel, Edward (2006) Toughness in graphs - A survey. Graphs and Combinatorics, 22 (1). pp. 1-35. ISSN 0911-0119

Borodin, O.V. and Broersma, H.J. and Glebov, A. and Heuvel, J. van den (2006) A new upper bound on the cyclic chromatic number. Journal of Graph Theory, 54 (1). pp. 58-72. ISSN 0364-9024

Brandt, S. and Broersma, H.J. and Diestel, R. and Kriesell, M. (2006) Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs. Combinatorica, 26 (1). pp. 17-36. ISSN 0209-9683

Broersma, H.J. and Capponi, A. and Paulusma, D. (2006) On-line coloring of H-free bipartite graphs. In: Proceedings of the 6th Italian Conference on Algorithms and Complexity (CIAC 2006), 29-31 May 2006, Rome, Italy (pp. pp. 284-295).

Broersma, H.J. and Fomin, F.V. and Kratochvil, J. and Woeginger, G.J. (2006) Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult. Algorithmica, 44 (4). pp. 343-361. ISSN 0178-4617

Broersma, H.J. and Johnson, M. and Paulusma, D. and Stewart, I.A. (2006) The Computational Complexity of the Parallel Knock-Out Problem. In: Proceedings of the 7th Latin American Symposium (LATIN 2006), 20-24 March 2006, Valdivia, Chile (pp. pp. 250-261).

Salman, A.N.M. and Broersma, H.J. (2006) Path-fan Ramsey numbers. Discrete Applied Mathematics, 154 (9). pp. 1429-1436. ISSN 0166-218X

Xiong, L. and Broersma, H.J. (2006) Subpancyclicity of line graphs and degree sums along paths. Discrete Applied Mathematics, 154 (9). pp. 1453-1463. ISSN 0166-218X

2005

Broersma, H.J. and Paulusma, D. and Smit, G.J.M. and Vlaardingerbroek, F. and Woeginger, G.J. (2005) The computational complexity of the minimum weight processor assignment problem. In: 30th International Workshop on Graph-Theoretic Concepts in Computer Science, June 21-23, 2004, Bad Honnef, Germany (pp. pp. 189-200).

Broersma, Hajo and Ruizenaar, Henri (2005) Handelsreizigers in wiskunde : promotionele activiteiten op de Universiteit Twente. Nieuw archief voor wiskunde, Ser. 5, vol. 6 (2). pp. 153-155. ISSN 0028-9825

2004

Guo, Yuanqing and Smit, Gerard J.M. and Broersma, Hajo and Rosien, Michel A.J. and Heysters, Paul M. and Krol, Thijs (2004) Mapping applications to a coarse grain reconfigurable system. In: New Algorithms, Architectures and Applications for Reconfigurable Computing. Kluwer Academic Publishers. ISBN 9781402031274

Salman, A.N.M. and Broersma, H.J. (2004) On Ramsey numbers for paths versus wheels. [Report]

Salman, A.N.M. and Broersma, H.J. (2004) Path-kipas Ramsey numbers. [Report]

Salman, A.N.M. and Broersma, H.J. (2004) The Ramsey Numbers of Paths Versus Kipases. In: Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 17 . Elsevier, pp. 251-255.

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. and Broersma, Hajo and Paulusma, Daniël and Wolkotte, Pascal T. (2004) Run-time mapping of applications to a heterogeneous reconfigurable tiled system on chip architecture. In: IEEE International Conference on Field-Programmable Technology, FPT 2004, December 6-8, 2004, Brisbane, Australia (pp. pp. 421-424).

Smit, Lodewijk T. and Smit, Gerard J.M. and Hurink, Johann L. and Broersma, Hajo and Paulusma, Daniël and Wolkotte, Pascal T. (2004) Run-time assignment of tasks to multiple heterogeneous processors. In: 5TH PROGRESS Symposium on Embedded Systems, Oct. 30, 2004, Nieuwegein, the Netherlands (pp. pp. 185-192).

Xiong, Liming and Broersma, H.J. and Li, Xueliang and Li, MingChu (2004) The hamiltonian index of a graph and its branch-bonds. Discrete Mathematics, 285 (1-3). pp. 279-288. ISSN 0012-365X

2003

Broersma, H.J. (2003) A general framework for coloring problems: old results, new results, and open problems. [Report]

Broersma, H.J. and Fomin, F.V. and Golovach, P.A. and Woeginger, G.J. (2003) Backbone colorings for networks: tree and path backbones. [Report]

Broersma, H.J. and Fomin, F.V. and Kratochvil, J. and Woeginger, G.J. (2003) Planar graph coloring avoiding monochromatic subgraphs: trees and paths make things difficult. [Report]

Broersma, H.J. and Fujisawa, J. and Yoshimoto, K. (2003) Backbone colorings along perfect matchings. [Report]

Broersma, Hajo and Faigle, Ulrich and Hurink, Johann and Pickl, Stefan and Woeginger, Gerhard (2003) Preface. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, p. 1.

Guo, Yuanqing and Smit, Gerard J.M. and Broersma, Hajo and Heysters, Paul M. (2003) Template Generation and Selection Algorithms. In: 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, IWSOC 2003, 30 June - 2 July 2003, Calgary, Alberta, Canada (pp. pp. 2-5).

Guo, Yuanqing and Smit, Gerard J.M. and Broersma, Hajo and Rosien, Michel A.J. and Heysters, Paul M. (2003) Mapping Applications to a Coarse Grain Reconfigurable System. In: 8th Asia-Pacific Conference on Advances in Computer Systems Architecture, ACSAC 2003, September 23-26, 2003, Aizu-Wakamatsu, Japan (pp. pp. 221-235).

Guo, Yuanqing and Smit, Gerard J.M. and Heysters, Paul M. and Broersma, Hajo (2003) A Graph Covering Algorithm for a Coarse Grain Reconfigurable System. In: ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems, LCTES 2003, June 11-13, 2003, San Diego, USA (pp. pp. 199-208).

Salman, A.N.M. and Broersma, H.J. (2003) The Ramsey Numbers of Paths Versus Fans. In: 2nd Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 13 . Elsevier, pp. 103-107.

Salman, A.N.M. and Broersma, H.J. (2003) Path-fan Ramsey numbers. [Report]

Salman, A.N.M. and Broersma, H.J. and Rodger, C.A. (2003) A continuation of spanning 2-connected subgraphs in truncated rectangular grid graphs. [Report]

Salman, A.N.M. and Broersma, H.J. and Rodger, C.A. (2003) More on spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs. [Report]

Smit, Lodewijk T. and Smit, Gerard J.M. and Havinga, Paul J.M. and Hurink, Johann L. and Broersma, Hajo (2003) Run-time control for software defined radio. In: PROGRESS 2003 Workshop on Embedded Systems, 22 October 2003, Utrecht, The Netherlands (pp. pp. 218-223).

2002

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (2002) Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. Discrete Applied Mathematics, 120 (1-3). pp. 13-23. ISSN 0166-218X

Bauer, Doug and Broersma, Hajo and Schmeichel, Edward (2002) More Progress on Tough Graphs - The Y2K Report. Electronic Notes in Discrete Mathematics, 11 . pp. 63-80. ISSN 1571-0653

Bodlaender, H.L. and Broersma, H.J. and Fomin, F.V. and Pyatkin, A.V. and Woeginger, G.J. (2002) Radio labeling with pre-assigned frequencies. [Report]

Borodin, O.V. and Broersma, H.J. and Glebov, A. and Heuvel, J. van den (2002) Stars and bunches in planar graphs. Part I: Triangulations. [Report]

Borodin, O.V. and Broersma, H.J. and Glebov, A. and Heuvel, J. van den (2002) Stars and bunches in planar graphs. Part II: General planar graphs and colourings. [Report]

Broersma, Hajo and Faudree, Ralph J. and Huck, Andreas and Trommel, Huib and Veldman, Henk Jan (2002) Forbidden subgraphs that imply hamiltonian-connectedness. Journal of Graph Theory, 40 (2). pp. 104-119. ISSN 0364-9024

Broersma, H.J. (2002) On some intriguing problems in hamiltonian graph theory - a survey. Discrete Mathematics, 251 (1-3). pp. 47-69. ISSN 0012-365X

Broersma, H.J. and Fomin, F.V. and Nešetřil, J. and Woeginger, G.J. (2002) More about subcolorings. [Report]

Broersma, H.J. and Li, Xueliang (2002) Some approaches to a conjecture on short cycles in digraphs. Discrete Applied Mathematics, 120 (1-3). pp. 45-53. ISSN 0166-218X

Broersma, H.J. and Xiong, Liming (2002) A note on minimum degree conditions for supereulerian graphs. Discrete Applied Mathematics, 120 (1-3). pp. 35-43. ISSN 0166-218X

Faigle, Ulrich and Broersma, Hajo and Hurink, Johann (2002) Foreword. Discrete Applied Mathematics, 120 (1-3). p. 1. ISSN 0166-218X

Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002) Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs. [Report]

Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002) Spanning 2-connected subgraphs in truncated rectangular grid graphs. [Report]

Salman, A.N.M. and Baskoro, E.T. and Broersma, H.J. (2002) More on spanning 2-connected subgraphs in truncated rectangular grid graphs. [Report]

Smit, Lodewijk T. and Smit, Gerard J.M. and Havinga, Paul J.M. and Hurink, Johann L. and Broersma, Hajo (2002) Influences of RAKE receiver/turbo decoder parameters on energy consumption and quality. In: World Wireless Congress On Third Generation Wireless and Beyond, 28-31 May 2002 , San Francisco, California (pp. pp. 175-181).

Surahmat, and Baskoro, E.T. and Broersma, H.J. (2002) The Ramsey numbers of large star-like trees versus large odd wheels. [Report]

Surahmat, and Baskoro, E.T. and Broersma, H.J. (2002) The Ramsey numbers of large cycles versus small wheels. [Report]

Xiong, L. and Ryjáček, Z. and Broersma, H.J. (2002) On stability of the Hamiltonian index under contractions and closures. [Report]

Xiong, Liming and Broersma, H.J. and Hoede, C. and Li, Xueliang (2002) Degree sums and subpancyclicity in line graphs. Discrete Mathematics, 242 (1-3). pp. 255-267. ISSN 0012-365X

2001

Broersma, H.J. and Kriesell, M. and Ryjacek, Z. (2001) On factors of 4-connected claw-free graphs. Journal of Graph Theory, 37 (2). pp. 125-136. ISSN 0364-9024

Broersma, H.J. and Xiong, L. and Yoshimoto, K. (2001) Toughness and hamiltonicity in $k$-trees. [Report]

Broersma, Hajo and Ryjacek, Zdenek (2001) Strengthening the closure concept in claw-free graphs. Discrete Mathematics, 233 (1-3). pp. 55-63. ISSN 0012-365X

Li, Xueliang and Zhang, Shenggui and Broersma, Hajo (2001) Paths and cycles in colored graphs. In: 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Electronic Notes in Discrete Mathematics, 8 . Elsevier, pp. 128-132.

Xiong, L. and Broersma, H.J. and Hoede, C. (2001) Subpancyclicity in the line graph of a graph with large degree sums of vertices along a path. [Report]

Xiong, L. and Broersma, H.J. and Li, X. (2001) The Hamiltonian index of a graph and its branch-bonds. [Report]

2000

Bauer, D. and Broersma, H.J. and Schmeichel, E. (2000) More progress on tough graphs - The Y2K report. [Report]

Bauer, D. and Broersma, H.J. and Veldman, H.J. (2000) Not every 2-tough graph is Hamiltonian. Discrete Applied Mathematics, 99 (1-3). pp. 317-321. ISSN 0166-218X

Broersma, H.J. and Dahlhaus, E. and Kloks, T. (2000) A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. Discrete Applied Mathematics, 99 (1-3). pp. 367-400. ISSN 0166-218X

Broersma, H.J. and Ryjacek, Z. (2000) Strengthening the closure concept in claw-free graphs. [Report]

Broersma, H.J. and Zhang, S. and Li, X. (2000) A $\sigma_3$ type condition for heavy cycles in weighted graphs. [Report]

Broersma, H.J. and Zhang, S. and Li, X. and Wang, L. (2000) A fan type condition for heavy cycles in weighted graphs. [Report]

Broersma, Hajo and Koppius, Otto and Tuinstra, Hilde and Huck, Andreas and Kloks, Ton and Kratsch, Dieter and Müller, Haiko (2000) Degree-preserving trees. Networks, 35 (1). pp. 26-39. ISSN 0028-3045

Li, X. and Zhang, S. and Broersma, H.J. (2000) Directed paths with few or many colors in colored directed graphs. [Report]

Zhang, Shenggui and Li, Xueliang and Broersma, Hajo (2000) Heavy paths and cycles in weighted graphs. Discrete Mathematics, 223 (1-3). pp. 327-336. ISSN 0012-365X

1999

Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E. (1999) Polynomial algorithms that prove an NP-hard hypothesis implies an NP-hard conclusion. [Report]

Broersma, H.J. (1999) On some intriguing problems in Hamiltonian graph theory -- A survey. [Report]

Broersma, H.J. and Bruin, N. and Hurink, J.L. and Meester, L.E. and Op de Beek, S.S. and Westhuis, J. (1999) Throughput of ADSL modems. [Report]

Broersma, H.J. and Faudree, R.J. and Huck, A. and Trommel, H. and Veldman, H.J. (1999) Forbidden subgraphs that imply Hamiltonian-connectedness. [Report]

Broersma, H.J. and Kriesell, M. and Ryjacek, Z. (1999) On factors of 4-connected claw-free graphs. [Report]

Broersma, H.J. and Xiong, L. (1999) On minimum degree conditions for supereulerian graphs. [Report]

Broersma, Hajo and Engbers, Erik and Trommel, Huib (1999) Various results on the toughness of graphs. Networks, 33 (3). pp. 233-238. ISSN 0028-3045

1998

Bohme, T. and Broersma, Hajo and Tuinstra, Hilde (1998) A note on a conjecture concerning tree-partitioning 3-regular graphs. [Report]

Broersma, H.J. and Trommel, H. (1998) Closure concepts for claw-free graphs. Discrete Mathematics, 185 (1-3). pp. 231-238. ISSN 0012-365X

Broersma, H.J. and Li, X. (1998) Some approaches to a conjecture on short cycles in digraphs. [Report]

Broersma, H.J. and Li, X. (1998) Isomorphisms and traversability of directed path graphs. [Report]

Broersma, Hajo and Tuinstra, Hilde (1998) Independence trees and Hamilton cycles. Journal of Graph Theory, 29 (4). pp. 227-237. ISSN 0364-9024

Zhang, S. and Li, X. and Broersma, H.J. (1998) Heavy paths and cycles in weighted graphs. [Report]

1997

Broersma, H.J. (1997) A note on the minimum size of a vertex pancyclic graph. Discrete Mathematics, 164 (1-3). pp. 29-32. ISSN 0012-365X

Broersma, H.J. and Engbers, E.A. and Trommel, H. (1997) Various results on the toughness of graphs. [Report]

Broersma, H.J. and Ryjacek, Z. and Schiermeyer, I. (1997) Dirac's minimum degree condition restricted to claws. Discrete Mathematics, 167-16 . pp. 155-166. ISSN 0012-365X

Broersma, Hajo and Li, Hao and Li, Jianping and Tian, Feng and Veldman, Henk Jan (1997) Cycles through subsets with large degree sums. Discrete Mathematics, 171 (1-3). pp. 43-54. ISSN 0012-365X

Böhme, T. and Broersma, H.J. and Göbel, F. and Kostochka, A.V. and Stiebitz, M. (1997) Spanning trees with pairwise nonadjacent endvertices. Discrete Mathematics, 170 (1-3). pp. 219-222. ISSN 0012-365X

1996

Asratian, A.S. and Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1996) On graphs satisfying a local ore-type condition. Journal of Graph Theory, 21 (1). pp. 1-10. ISSN 0364-9024

Broersma, H.J. and Heuvel, J. van den and Jackson, B. and Veldman, H.J. (1996) Hamiltonicity of regular 2-connected graphs. Journal of Graph Theory, 22 (2). pp. 105-124. ISSN 0364-9024

Broersma, H.J. and Ryjacek, Z. and Schiermeyer, I. (1996) Toughness and hamiltonicity in almost claw-free graphs. Journal of Graph Theory, 21 (4). pp. 431-439. ISSN 0364-9024

Broersma, Hajo and Li, Xueliang (1996) Directed path graphs. [Report]

Böhme, T. and Broersma, H.J. and Veldman, H.J. (1996) Toughness and longest cycles in 2-connected planar graphs. Journal of Graph Theory, 23 (3). pp. 257-263. ISSN 0364-9024

1995

Bauer, Douglas and Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1995) Long cycles in graphs with prescribed toughness and minimum degree. Discrete Mathematics, 141 (1-3). pp. 1-10. ISSN 0012-365X

Broersma, H.J. and Göbel, F. (1995) Bipartite regular graphs with fixed diameter. Networks, 26 (3). pp. 139-144. ISSN 0028-3045

Broersma, H.J. and Lu, M. (1995) Cycles through particular subgraphs of claw-free graphs. Journal of Graph Theory, 20 (4). pp. 459-465. ISSN 0364-9024

1994

Broersma, H.J. and Schiermeyer, I. (1994) A closure concept based on neighborhood unions of independent triples. Discrete Mathematics, 124 (1-3). pp. 37-47. ISSN 0012-365X

Broersma, H.J. and Schiermeyer, I. (1994) Subgraphs, Closures and Hamiltonicity. Discrete Applied Mathematics, 51 (1-2). pp. 39-46. ISSN 0166-218X

1993

Broersma, H.J. (1993) A note on K4-closures in Hamiltonian graph theory. Discrete Mathematics, 121 (1-3). pp. 19-23. ISSN 0012-365X

Broersma, H.J. and Duijvestijn, A.J.W. and Göbel, F. (1993) Generating all 3-connected 4-regular planar graphs from the octahedron graph. Journal of Graph Theory, 17 (5). pp. 613-620. ISSN 0364-9024

Broersma, H.J. and Faudree, R.J. and Heuvel, J. van den and Veldman, H.J. (1993) Decomposition of bipartite graphs under degree constraints. Networks, 23 (3). pp. 159-164. ISSN 0028-3045

Broersma, H.J. and Göbel, F. (1993) Coloring a graph optimally with two colors. Discrete Mathematics, 118 (1-3). pp. 23-31. ISSN 0012-365X

Broersma, H.J. and Heuvel, J. van den and Jung, H.A. and Veldman, H.J. (1993) Cycles containing all vertices of maximum degree. Journal of Graph Theory, 17 (3). pp. 373-385. ISSN 0364-9024

Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1993) A generalization of Ore's Theorem involving neighborhood unions. Discrete Mathematics, 122 (1-3). pp. 37-49. ISSN 0012-365X

Broersma, H.J. and Heuvel, J. van den and Veldman, H.J. (1993) Long cycles, degree sums and neighborhood unions. Discrete Mathematics, 121 (1-3). pp. 25-35. ISSN 0012-365X

Broersma, H.J. and Li, Xueliang (1993) On "the matching polynomial of a polygraph". Discrete Applied Mathematics, 46 (1). pp. 79-86. ISSN 0166-218X

1992

Broersma, H.J. and Li, Xueliang (1992) The connectivity of the basis graph of a branching greedoid. Journal of graph theory, 16 (3). pp. 233-237. ISSN 0364-9024

1991

Broersma, H.J. and Veldman, H.J. (1991) Long dominating cycles and paths in graphs with large neighborhood unions. Journal of Graph Theory, 15 (1). pp. 29-38. ISSN 0364-9024

1989

Bauer, Douglas and Broersma, H.J. and Veldman, H.J. and Rao, Li (1989) A generalization of a result of Häggkvist and Nicoghossian. Journal of Combinatorial Theory, Series B, 47 (2). pp. 237-243. ISSN 0021-9800

Broersma, H.J. and Hoede, C. (1989) Path graphs. Journal of Graph Theory, 13 (4). pp. 427-444. ISSN 0364-9024

1988

Broersma, H.J. (1988) Existence of Δλ-cycles and Δλ-paths. Journal of Graph Theory, 12 (4). pp. 499-507. ISSN 0364-9024

1987

Broersma, H.J. and Veldman, H.J. (1987) 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. Journal of Graph Theory, 11 (3). pp. 399-407. ISSN 0364-9024

This list was generated on Sat Oct 25 05:34:24 2014 CEST.