Publication:3115195
From MaRDI portal
zbMath1249.05130MaRDI QIDQ3115195
Publication date: 20 February 2012
05C15: Coloring of graphs and hypergraphs
Related Items
Critical elements in combinatorially closed families of graph classes, A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs, On integer programming with bounded determinants, The width and integer optimization on simplices with bounded minors of the constraint matrices, Vertex coloring of graphs with few obstructions, The coloring problem for classes with two small obstructions, Two complexity results for the vertex coloring problem, Critical hereditary graph classes: a survey, Boundary properties of graphs for algorithmic graph problems, The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs, Boundary classes for graph problems involving non-local properties, Boundary graph classes for some maximum induced subgraph problems