Author Publications

Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Date | Item Type
Jump to: 2013 | 2009 | 2000 | 1998
Number of items: 5.

2013

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

2009

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).

2000

Bauer, D. and Katona, G.Y. and Kratsch, D. and Veldman, H.J. (2000) Chordality and 2-factors in tough graphs. Discrete Mathematics, 99 (1-3). pp. 323-329. ISSN 0012-365X

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

1998

Kloks, T. and Kratsch, D. and Wong, C.K. (1998) Minimum fill-in on circle and circular-arc graphs. Journal of algorithms, 28 (2). pp. 272-289. ISSN 0196-6774

This list was generated on Thu Aug 28 05:19:25 2014 CEST.