Vertex coloring of graphs with few obstructions
From MaRDI portal
Publication:344868
DOI10.1016/j.dam.2015.02.015zbMath1350.05038MaRDI QIDQ344868
Vadim V. Lozin, Dmitriy S. Malyshev
Publication date: 24 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.02.015
68Q25: Analysis of algorithms and problem complexity
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs, List coloring in the absence of two subgraphs