Bert Randerath - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2020

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. DAM, 272:1, 2020. [doi]

2019

On the chromatic number of 2K2-free graphsChristoph Brause, Bert Randerath, Ingo Schiermeyer, Elkin Vumar. DAM, 253:14-24, 2019. [doi]

Polynomial χ -Binding Functions and Forbidden Induced Subgraphs: A SurveyIngo Schiermeyer, Bert Randerath. gc, 35(1):1-31, 2019. [doi]

2016

A lower bound on the independence number of a graph in terms of degrees and local clique sizesChristoph Brause, Bert Randerath, Dieter Rautenbach, Ingo Schiermeyer. DAM, 209:59-67, 2016. [doi]

2013

On mirror nodes in graphs without long induced pathsKatharina Hammersen, Bert Randerath. ajc, 55:263-272, 2013. [doi]

2010

All P::3::-equipackable graphsBert Randerath, Preben D. Vestergaard. DM, 310(2):355-359, 2010. [doi]

On maximum independent sets in P::5::-free graphsBert Randerath, Ingo Schiermeyer. DAM, 158(9):1041-1044, 2010. [doi]

2009

Bounds on the global offensive ::::k::::-alliance number in graphsMustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann. dmgt, 29(3):597-613, 2009. [doi]

An upper bound on the domination number of a graph with minimum degree 2Allan Frendrup, Michael A. Henning, Bert Randerath, Preben D. Vestergaard. DM, 309(4):639-646, 2009. [doi]

2008

Preface for CTW2005 special issueUlrich Faigle, Bert Randerath, Rainer Schrader. DAM, 156(17):3155, 2008. [doi]

2007

Factoring logic functions using star-coloringsTatjana Gerzen, Bert Randerath. ajc, 39:115-128, 2007. [doi]

On the complexity of 4-coloring graphs without long induced pathsVan Bang Le, Bert Randerath, Ingo Schiermeyer. TCS, 389(1-2):330-335, 2007. [doi]

2006

On Linear CNF FormulasStefan Porschen, Ewald Speckenmeyer, Bert Randerath. sat 2006: 212-225 [doi]

Well-covered graphs and factorsBert Randerath, Preben D. Vestergaard. DAM, 154(9):1416-1428, 2006. [doi]

2005

Exact 3-satisfiability is decidable in time O(2:::0.16254::::n:::::::)Stefan Porschen, Bert Randerath, Ewald Speckenmeyer. AMAI, 43(1):173-193, 2005. [doi]

2004

3-Colorability and forbidden subgraphs. I: Characterizing pairsBert Randerath. DM, 276(1-3):313-325, 2004. [doi]

3-Colorability in P for P::6::-free graphsBert Randerath, Ingo Schiermeyer. DAM, 136(2-3):299-313, 2004. [doi]

Vertex Colouring and Forbidden Subgraphs - A SurveyBert Randerath, Ingo Schiermeyer. gc, 20(1):1-40, 2004. [doi]

2003

The 3-Colorability Problem on Graphs with Maximum Degree FourMartin Kochol, Vadim V. Lozin, Bert Randerath. SICOMP, 32(5):1128-1139, 2003. [doi]

On stable cutsets in line graphsVan Bang Le, Bert Randerath. TCS, 1-3(301):463-475, 2003. [doi]

Linear Time Algorithms for Some Not-All-Equal Satisfiability ProblemsStefan Porschen, Bert Randerath, Ewald Speckenmeyer. sat 2004: 172-187 [doi]

2002

On well-covered graphs of odd girth 7 or greaterBert Randerath, Preben D. Vestergaard. dmgt, 22(1):159-172, 2002. [doi]

A note on Brooks' theorem for triangle-free graphsBert Randerath, Ingo Schiermeyer. ajc, 26:3-10, 2002. [doi]

Vertex pancyclic graphsBert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann. DAM, 120(1-3):219-237, 2002.

Three-colourability and forbidden subgraphs. II: polynomial algorithmsBert Randerath, Ingo Schiermeyer, Meike Tewes. DM, 251(1-3):137-153, 2002. [doi]

2001

, r-free graphsJochen Harant, Margit Voigt, Stanislav Jendrol, Bert Randerath, Zdenek Ryjácek, Ingo Schiermeyer. jgt, 36(3):131-143, 2001. [doi]

On Stable Cutsets in Line GraphsVan Bang Le, Bert Randerath. criwg 2001: 263-271 [doi]

3-Colorability element oF P for p::6::-free GraphsBert Randerath, Ingo Schiermeyer. endm, 8:85-89, 2001. [doi]

Colouring Graphs with Prescribed Induced Cycle LengthsBert Randerath, Ingo Schiermeyer. dmgt, 21(2):267-281, 2001. [doi]

A Satisfiability Formulation of Problems on Level GraphsBert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek. endm, 9:269-277, 2001. [doi]

2000

3-Colourability and Forbidden SubgraphsBert Randerath. endm, 5:270-273, 2000. [doi]

1999

Maximal Sets of 2-Factors in Complete Equipartite GraphsArne Hoffmann, Bert Randerath, Lutz Volkmann. endm, 3:82-85, 1999. [doi]

On quadrilaterals in a graphBert Randerath, Ingo Schiermeyer, Hong Wang 0022. DM, 203(1-3):229-237, 1999. [doi]

Vertex Pancyclic GraphsBert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes. endm, 3:166-170, 1999. [doi]

Colouring Graphs with Prescribed Induced Cycle LengthsIngo Schiermeyer, Bert Randerath. soda 1999: 965-966 [doi]

1998

Regular factors of simple regular graphs and factor-spectraThomas Niessen, Bert Randerath. DM, 185(1-3):89-103, 1998. [doi]

Characterization of graphs with equal domination and covering numberBert Randerath, Lutz Volkmann. DM, 191(1-3):159-169, 1998. [doi]

1997

Simplicial Graphs and Relationships to Different Graph InvariantsBert Randerath, Lutz Volkmann. arscom, 46, 1997.

1994

A characterization of well covered block-cactus graphsBert Randerath, Lutz Volkmann. ajc, 9:307, 1994. [doi]

Sign in or sign up to see more results.

runs on WebDSL