On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number
From MaRDI portal
Publication:4917372
DOI10.1515/dma.2011.038zbMath1263.05033OpenAlexW2091481925MaRDI QIDQ4917372
Publication date: 29 April 2013
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.2011.038
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
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 ⋮ The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs