Person:708333: Difference between revisions

From MaRDI portal
Person:708333
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Bert Randerath to Bert Randerath: Duplicate
 
(No difference)

Latest revision as of 22:25, 10 December 2023

Available identifiers

zbMath Open randerath.bertMaRDI QIDQ708333

List of research outcomes





PublicationDate of PublicationType
Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey2019-03-21Paper
On the chromatic number of \(2 K_2\)-free graphs2018-12-18Paper
Claw-free graphs with equal 2-domination and domination numbers2017-07-19Paper
https://portal.mardi4nfdi.de/entity/Q28160402016-07-01Paper
https://portal.mardi4nfdi.de/entity/Q28161342016-07-01Paper
A lower bound on the independence number of a graph in terms of degrees and local clique sizes2016-06-21Paper
https://portal.mardi4nfdi.de/entity/Q28693082014-01-03Paper
https://portal.mardi4nfdi.de/entity/Q31150502012-02-20Paper
On maximum independent sets in \(P_{5}\)-free graphs2010-10-11Paper
Bounds on the global offensive k-alliance number in graphs2010-05-14Paper
All \(P_{3}\)-equipackable graphs2010-03-29Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
An upper bound on the domination number of a graph with minimum degree 22009-04-09Paper
https://portal.mardi4nfdi.de/entity/Q54425282008-02-22Paper
On the complexity of 4-coloring graphs without long induced paths2008-01-07Paper
On Linear CNF Formulas2007-09-04Paper
https://portal.mardi4nfdi.de/entity/Q34247902007-03-05Paper
Well-covered graphs and factors2006-06-09Paper
https://portal.mardi4nfdi.de/entity/Q57026512005-11-02Paper
Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\)2005-05-13Paper
Vertex colouring and forbidden subgraphs -- a survey2004-12-13Paper
3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.2004-03-14Paper
https://portal.mardi4nfdi.de/entity/Q44487652004-02-18Paper
3-colorability and forbidden subgraphs. I: Characterizing pairs2004-02-14Paper
The 3-Colorability Problem on Graphs with Maximum Degree Four2003-09-28Paper
On stable cutsets in line graphs2003-07-30Paper
On well-covered graphs of odd girth 7 or greater2003-06-13Paper
Chromatic number of graphs each path of which is 3-colourable2003-03-18Paper
Colouring Graphs with Prescribed Induced Cycle Lengths2003-01-07Paper
https://portal.mardi4nfdi.de/entity/Q47804992002-11-20Paper
Vertex pancyclic graphs2002-08-29Paper
Three-colourability and forbidden subgraphs. II: Polynomial algorithms2002-08-29Paper
https://portal.mardi4nfdi.de/entity/Q27415312001-09-24Paper
https://portal.mardi4nfdi.de/entity/Q27413422001-09-23Paper
https://portal.mardi4nfdi.de/entity/Q27413622001-09-23Paper
On weights of induced paths and cycles in claw-free andK1,r-free graphs2001-07-08Paper
Regular factors of simple regular graphs and factor-spectra2000-11-02Paper
Characterization of graphs with equal domination and covering number2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q49400522000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42672051999-09-22Paper
On quadrilaterals in a graph1999-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42524331999-06-17Paper
https://portal.mardi4nfdi.de/entity/Q43043381995-01-26Paper

Research outcomes over time

This page was built for person: Bert Randerath