Bert Randerath

Publication Activity (10 Years)

Years Active: 1994-2020
Publications (10 Years): 4

Top Topics

Smooth Functions

Real World Graphs

Top Venues

Discret. Appl. Math.

Australas. J Comb.

Publications

Britta Peis, Oliver Schaudt, Heiko Röglin, Bert Randerath, Rainer Schrader, Frank Vallentin
Preface: 15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2017). Discret. Appl. Math. 272 (2020)
Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar
On the chromatic number of 2K2-free graphs. Discret. Appl. Math. 253 (2019)
Ingo Schiermeyer, Bert Randerath
Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey. Graphs Comb. 35 (1) (2019)
Christoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer
A lower bound on the independence number of a graph in terms of degrees and local clique sizes. Discret. Appl. Math. 209 (2016)
Katharina Hammersen, Bert Randerath
On mirror nodes in graphs without long induced paths. Australas. J Comb. 55 (2013)
Bert Randerath, Preben D. Vestergaard
-equipackable graphs. Discret. Math. 310 (2) (2010)
Bert Randerath, Ingo Schiermeyer
-free graphs. Discret. Appl. Math. 158 (9) (2010)
Allan Frendrup, Michael A. Henning, Bert Randerath, Preben D. Vestergaard
An upper bound on the domination number of a graph with minimum degree 2. Discret. Math. 309 (4) (2009)
Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann
-alliance number in graphs. Discuss. Math. Graph Theory 29 (3) (2009)
Ulrich Faigle, Bert Randerath, Rainer Schrader
Preface for CTW2005 special issue. Discret. Appl. Math. 156 (17) (2008)
Tatjana Gerzen, Bert Randerath
Factoring logic functions using star-colorings. Australas. J Comb. 39 (2007)
Van Bang Le, Bert Randerath, Ingo Schiermeyer
On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389 (1-2) (2007)
Bert Randerath, Preben D. Vestergaard
Well-covered graphs and factors. Discret. Appl. Math. 154 (9) (2006)
Stefan Porschen, Ewald Speckenmeyer, Bert Randerath
On Linear CNF Formulas. SAT (2006)
Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
). Ann. Math. Artif. Intell. 43 (1) (2005)
Bert Randerath, Ingo Schiermeyer
Vertex Colouring and Forbidden Subgraphs - A Survey. Graphs Comb. 20 (1) (2004)
Bert Randerath, Ingo Schiermeyer
-free graphs. Discret. Appl. Math. 136 (2-3) (2004)
Bert Randerath
3-Colorability and forbidden subgraphs. I: Characterizing pairs. Discret. Math. 276 (1-3) (2004)
Martin Kochol, Vadim V. Lozin, Bert Randerath
The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput. 32 (5) (2003)
Van Bang Le, Bert Randerath
On stable cutsets in line graphs. Theor. Comput. Sci. 301 (1-3) (2003)
Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. SAT (2003)
Bert Randerath, Ingo Schiermeyer, Meike Tewes
Three-colourability and forbidden subgraphs. II: polynomial algorithms. Discret. Math. 251 (1-3) (2002)
Bert Randerath, Ingo Schiermeyer
A note on Brooks' theorem for triangle-free graphs. Australas. J Comb. 26 (2002)
Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann
Vertex pancyclic graphs. Discret. Appl. Math. 120 (1-3) (2002)
Bert Randerath, Preben D. Vestergaard
On well-covered graphs of odd girth 7 or greater. Discuss. Math. Graph Theory 22 (1) (2002)
Bert Randerath, Ingo Schiermeyer
-free Graphs. Electron. Notes Discret. Math. 8 (2001)
Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer
-free graphs. J. Graph Theory 36 (3) (2001)
Bert Randerath, Ingo Schiermeyer
Colouring Graphs with Prescribed Induced Cycle Lengths. Discuss. Math. Graph Theory 21 (2) (2001)
Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek
A Satisfiability Formulation of Problems on Level Graphs. Electron. Notes Discret. Math. 9 (2001)
Van Bang Le, Bert Randerath
On Stable Cutsets in Line Graphs. WG (2001)
Bert Randerath
3-Colourability and Forbidden Subgraphs. Electron. Notes Discret. Math. 5 (2000)
Bert Randerath, Ingo Schiermeyer, Hong Wang
On quadrilaterals in a graph. Discret. Math. 203 (1-3) (1999)
Ingo Schiermeyer, Bert Randerath
Colouring Graphs with Prescribed Induced Cycle Lengths. SODA (1999)
Arne Hoffmann, Bert Randerath, Lutz Volkmann
Maximal Sets of 2-Factors in Complete Equipartite Graphs. Electron. Notes Discret. Math. 3 (1999)
Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes
Vertex Pancyclic Graphs. Electron. Notes Discret. Math. 3 (1999)
Thomas Niessen, Bert Randerath
Regular factors of simple regular graphs and factor-spectra. Discret. Math. 185 (1-3) (1998)
Bert Randerath, Lutz Volkmann
Characterization of graphs with equal domination and covering number. Discret. Math. 191 (1-3) (1998)
Bert Randerath, Lutz Volkmann
Simplicial Graphs and Relationships to Different Graph Invariants. Ars Comb. 46 (1997)
Bert Randerath, Lutz Volkmann
A characterization of well covered block-cactus graphs. Australas. J Comb. 9 (1994)