default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBert Randerath
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j35]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: 1 (2020)- 2019
- [j34]Christoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar:
On the chromatic number of 2K2-free graphs. Discret. Appl. Math. 253: 14-24 (2019) - [j33]Ingo Schiermeyer, Bert Randerath:
Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A Survey. Graphs Comb. 35(1): 1-31 (2019) - 2016
- [j32]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: 59-67 (2016) - 2013
- [j31]Katharina Hammersen, Bert Randerath:
On mirror nodes in graphs without long induced paths. Australas. J Comb. 55: 263-272 (2013) - 2010
- [j30]Bert Randerath, Ingo Schiermeyer:
On maximum independent sets in P5-free graphs. Discret. Appl. Math. 158(9): 1041-1044 (2010) - [j29]Bert Randerath, Preben D. Vestergaard:
All P3-equipackable graphs. Discret. Math. 310(2): 355-359 (2010) - 2009
- [j28]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): 639-646 (2009) - [j27]Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann:
Bounds on the global offensive k-alliance number in graphs. Discuss. Math. Graph Theory 29(3): 597-613 (2009) - 2008
- [j26]Ulrich Faigle, Bert Randerath, Rainer Schrader:
Preface for CTW2005 special issue. Discret. Appl. Math. 156(17): 3155 (2008) - 2007
- [j25]Tatjana Gerzen, Bert Randerath:
Factoring logic functions using star-colorings. Australas. J Comb. 39: 115-128 (2007) - [j24]Van Bang Le, Bert Randerath, Ingo Schiermeyer:
On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389(1-2): 330-335 (2007) - 2006
- [j23]Bert Randerath, Preben D. Vestergaard:
Well-covered graphs and factors. Discret. Appl. Math. 154(9): 1416-1428 (2006) - 2005
- [j22]Stefan Porschen, Bert Randerath, Ewald Speckenmeyer:
Exact 3-satisfiability is decidable in time O(20.16254n). Ann. Math. Artif. Intell. 43(1): 173-193 (2005) - 2004
- [j21]Bert Randerath, Ingo Schiermeyer:
3-Colorability in P for P6-free graphs. Discret. Appl. Math. 136(2-3): 299-313 (2004) - [j20]Bert Randerath:
3-Colorability and forbidden subgraphs. I: Characterizing pairs. Discret. Math. 276(1-3): 313-325 (2004) - [j19]Bert Randerath, Ingo Schiermeyer:
Vertex Colouring and Forbidden Subgraphs - A Survey. Graphs Comb. 20(1): 1-40 (2004) - 2003
- [j18]Martin Kochol, Vadim V. Lozin, Bert Randerath:
The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput. 32(5): 1128-1139 (2003) - [j17]Van Bang Le, Bert Randerath:
On stable cutsets in line graphs. Theor. Comput. Sci. 301(1-3): 463-475 (2003) - 2002
- [j16]Bert Randerath, Ingo Schiermeyer:
A note on Brooks' theorem for triangle-free graphs. Australas. J Comb. 26: 3-10 (2002) - [j15]Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann:
Vertex pancyclic graphs. Discret. Appl. Math. 120(1-3): 219-237 (2002) - [j14]Bert Randerath, Ingo Schiermeyer, Meike Tewes:
Three-colourability and forbidden subgraphs. II: polynomial algorithms. Discret. Math. 251(1-3): 137-153 (2002) - [j13]Bert Randerath, Preben D. Vestergaard:
On well-covered graphs of odd girth 7 or greater. Discuss. Math. Graph Theory 22(1): 159-172 (2002) - 2001
- [j12]Bert Randerath, Ingo Schiermeyer:
Colouring Graphs with Prescribed Induced Cycle Lengths. Discuss. Math. Graph Theory 21(2): 267-281 (2001) - [j11]Bert Randerath, Ingo Schiermeyer:
3-Colorability element oF P for p6-free Graphs. Electron. Notes Discret. Math. 8: 85-89 (2001) - [j10]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: 269-277 (2001) - [j9]Jochen Harant, Margit Voigt, Stanislav Jendrol', Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer:
On weights of induced paths and cycles in claw-free and K1, r-free graphs. J. Graph Theory 36(3): 131-143 (2001) - 2000
- [j8]Bert Randerath:
3-Colourability and Forbidden Subgraphs. Electron. Notes Discret. Math. 5: 270-273 (2000) - 1999
- [j7]Bert Randerath, Ingo Schiermeyer, Hong Wang:
On quadrilaterals in a graph. Discret. Math. 203(1-3): 229-237 (1999) - [j6]Arne Hoffmann, Bert Randerath, Lutz Volkmann:
Maximal Sets of 2-Factors in Complete Equipartite Graphs. Electron. Notes Discret. Math. 3: 82-85 (1999) - [j5]Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes:
Vertex Pancyclic Graphs. Electron. Notes Discret. Math. 3: 166-170 (1999) - 1998
- [j4]Thomas Niessen, Bert Randerath:
Regular factors of simple regular graphs and factor-spectra. Discret. Math. 185(1-3): 89-103 (1998) - [j3]Bert Randerath, Lutz Volkmann:
Characterization of graphs with equal domination and covering number. Discret. Math. 191(1-3): 159-169 (1998) - 1997
- [j2]Bert Randerath, Lutz Volkmann:
Simplicial Graphs and Relationships to Different Graph Invariants. Ars Comb. 46 (1997) - 1994
- [j1]Bert Randerath, Lutz Volkmann:
A characterization of well covered block-cactus graphs. Australas. J Comb. 9: 307- (1994)
Conference and Workshop Papers
- 2006
- [c4]Stefan Porschen, Ewald Speckenmeyer, Bert Randerath:
On Linear CNF Formulas. SAT 2006: 212-225 - 2003
- [c3]Stefan Porschen, Bert Randerath, Ewald Speckenmeyer:
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. SAT 2003: 172-187 - 2001
- [c2]Van Bang Le, Bert Randerath:
On Stable Cutsets in Line Graphs. WG 2001: 263-271 - 1999
- [c1]Ingo Schiermeyer, Bert Randerath:
Colouring Graphs with Prescribed Induced Cycle Lengths. SODA 1999: 965-966
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
