Bert Randerath

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