scientific article; zbMATH DE number 1833071
From MaRDI portal
Publication:4780499
zbMath1018.05036MaRDI QIDQ4780499
Bert Randerath, Ingo Schiermeyer
Publication date: 20 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
List coloring in the absence of two subgraphs ⋮ The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices ⋮ Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs ⋮ Colouring of graphs with Ramsey-type forbidden subgraphs ⋮ Brooks' theorem for generalized dart graphs ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ 3-colorability and forbidden subgraphs. I: Characterizing pairs ⋮ Dichotomy for Coloring of Dart Graphs ⋮ Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree ⋮ Colouring Vertices of Triangle-Free Graphs ⋮ Colouring vertices of triangle-free graphs without forests
This page was built for publication:
