The following pages link to Bert Randerath (Q708333):
Displaying 48 items.
- (Q298955) (redirect page) (← links)
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- On maximum independent sets in \(P_{5}\)-free graphs (Q708334) (← links)
- All \(P_{3}\)-equipackable graphs (Q960935) (← links)
- An upper bound on the domination number of a graph with minimum degree 2 (Q1011694) (← links)
- On quadrilaterals in a graph (Q1301667) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- Finding a \(\Delta\)-regular supergraph of minimum order (Q1408809) (← links)
- 3-colorability and forbidden subgraphs. I: Characterizing pairs (Q1422435) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- Regular factors of simple regular graphs and factor-spectra (Q1584246) (← links)
- Characterization of graphs with equal domination and covering number (Q1584421) (← links)
- Chromatic number of graphs each path of which is 3-colourable (Q1601403) (← links)
- Vertex pancyclic graphs (Q1613376) (← links)
- Three-colourability and forbidden subgraphs. II: Polynomial algorithms (Q1613477) (← links)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Exact 3-satisfiability is decidable in time \(O(2^{0.16254 n})\) (Q1777401) (← links)
- Vertex colouring and forbidden subgraphs -- a survey (Q1889838) (← links)
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- Well-covered graphs and factors (Q2492219) (← links)
- Vertex-disjoint cycles containing specified vertices in a graph (Q2508413) (← links)
- On weights of induced paths and cycles in claw-free andK1,r-free graphs (Q2712590) (← links)
- (Q2741342) (← links)
- (Q2741362) (← links)
- (Q2741531) (← links)
- (Q2816040) (← links)
- (Q2816134) (← links)
- (Q2869308) (← links)
- (Q3115050) (← links)
- (Q3424790) (← links)
- Bounds on the global offensive k-alliance number in graphs (Q3560785) (← links)
- (Q4252433) (← links)
- (Q4267205) (← links)
- (Q4304338) (← links)
- The 3-Colorability Problem on Graphs with Maximum Degree Four (Q4429678) (← links)
- (Q4448765) (← links)
- Colouring Graphs with Prescribed Induced Cycle Lengths (Q4542873) (← links)
- (Q4780499) (← links)
- On well-covered graphs of odd girth 7 or greater (Q4786795) (← links)
- (Q4940052) (← links)
- Claw-free graphs with equal 2-domination and domination numbers (Q5279559) (← links)
- Theory and Applications of Satisfiability Testing (Q5325860) (← links)
- (Q5442528) (← links)
- (Q5702651) (← links)
- On Linear CNF Formulas (Q5756579) (← links)
