A characterization of well covered block-cactus graphs. - Bert Randerath; Lutz Volkmann (Australas. J Comb., 1994)

Simplicial Graphs and Relationships to Different Graph Invariants. - Bert Randerath; Lutz Volkmann (Ars Comb., 1997)

Regular factors of simple regular graphs and factor-spectra. - Thomas Niessen; Bert Randerath (Discret. Math., 1998)

Characterization of graphs with equal domination and covering number. - Bert Randerath; Lutz Volkmann (Discret. Math., 1998)

On quadrilaterals in a graph. - Bert Randerath; Ingo Schiermeyer; Hong Wang 005 (Discret. Math., 1999)

Maximal Sets of 2-Factors in Complete Equipartite Graphs. - Arne Hoffmann; Bert Randerath; Lutz Volkmann (Electron. Notes Discret. Math., 1999)

3-Colourability and Forbidden Subgraphs. - Bert Randerath (Electron. Notes Discret. Math., 2000)

Colouring Graphs with Prescribed Induced Cycle Lengths. - Bert Randerath; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2001)

3-Colorability element oF P for p6-free Graphs. - Bert Randerath; Ingo Schiermeyer (Electron. Notes Discret. Math., 2001)

A Satisfiability Formulation of Problems on Level Graphs. - Bert Randerath; Ewald Speckenmeyer; Endre Boros; Peter L. Hammer; Alexander Kogan; Kazuhisa Makino; Bruno Simeone; Ondrej Cepek (Electron. Notes Discret. Math., 2001)

On weights of induced paths and cycles in claw-free and K1, r-free graphs. - Jochen Harant; Margit Voigt; Stanislav Jendrol'; Bert Randerath; Zdenek Ryjácek; Ingo Schiermeyer (J. Graph Theory, 2001)

A note on Brooks' theorem for triangle-free graphs. - Bert Randerath; Ingo Schiermeyer (Australas. J Comb., 2002)

Vertex pancyclic graphs. - Bert Randerath; Ingo Schiermeyer; Meike Tewes; Lutz Volkmann (Discret. Appl. Math., 2002)

Three-colourability and forbidden subgraphs. II: polynomial algorithms. - Bert Randerath; Ingo Schiermeyer; Meike Tewes (Discret. Math., 2002)

On well-covered graphs of odd girth 7 or greater. - Bert Randerath; Preben D. Vestergaard (Discuss. Math. Graph Theory, 2002)

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. - Stefan Porschen; Bert Randerath; Ewald Speckenmeyer (SAT, 2003)

The 3-Colorability Problem on Graphs with Maximum Degree Four. - Martin Kochol; Vadim V. Lozin; Bert Randerath (SIAM J. Comput., 2003)

On stable cutsets in line graphs. - Van Bang Le; Bert Randerath (Theor. Comput. Sci., 2003)

3-Colorability in P for P6-free graphs. - Bert Randerath; Ingo Schiermeyer (Discret. Appl. Math., 2004)

3-Colorability and forbidden subgraphs. I: Characterizing pairs. - Bert Randerath (Discret. Math., 2004)

Vertex Colouring and Forbidden Subgraphs - A Survey. - Bert Randerath; Ingo Schiermeyer (Graphs Comb., 2004)

Exact 3-satisfiability is decidable in time O(20.16254n). - Stefan Porschen; Bert Randerath; Ewald Speckenmeyer (Ann. Math. Artif. Intell., 2005)

On Linear CNF Formulas. - Stefan Porschen; Ewald Speckenmeyer; Bert Randerath (SAT, 2006)

Well-covered graphs and factors. - Bert Randerath; Preben D. Vestergaard (Discret. Appl. Math., 2006)

Factoring logic functions using star-colorings. - Tatjana Gerzen; Bert Randerath (Australas. J Comb., 2007)

On the complexity of 4-coloring graphs without long induced paths. - Van Bang Le; Bert Randerath; Ingo Schiermeyer (Theor. Comput. Sci., 2007)

Preface for CTW2005 special issue. - Ulrich Faigle; Bert Randerath; Rainer Schrader (Discret. Appl. Math., 2008)

An upper bound on the domination number of a graph with minimum degree 2. - Allan Frendrup; Michael A. Henning; Bert Randerath; Preben D. Vestergaard (Discret. Math., 2009)

Bounds on the global offensive k-alliance number in graphs. - Mustapha Chellali; Teresa W. Haynes; Bert Randerath; Lutz Volkmann (Discuss. Math. Graph Theory, 2009)

On maximum independent sets in P5-free graphs. - Bert Randerath; Ingo Schiermeyer (Discret. Appl. Math., 2010)

All P3-equipackable graphs. - Bert Randerath; Preben D. Vestergaard (Discret. Math., 2010)

On mirror nodes in graphs without long induced paths. - Katharina Hammersen; Bert Randerath (Australas. J Comb., 2013)

A lower bound on the independence number of a graph in terms of degrees and local clique sizes. - Christoph Brause; Bert Randerath; Dieter Rautenbach; Ingo Schiermeyer (Discret. Appl. Math., 2016)

On the chromatic number of 2K2-free graphs. - Christoph Brause; Bert Randerath; Ingo Schiermeyer; Elkin Vumar (Discret. Appl. Math., 2019)

Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey. - Ingo Schiermeyer; Bert Randerath (Graphs Comb., 2019)

Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). - Britta Peis; Oliver Schaudt; Heiko Röglin; Bert Randerath; Rainer Schrader; Frank Vallentin (Discret. Appl. Math., 2020)