On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number

DOI10.1515/DMA.2011.038MaRDI QIDQ4917372zbMATH OpenOpenAlexFDO

Authors D. S. Malyshev

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

zbMATH Keywords

\(k\)-colouring problemchromatic number problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Recommendations

• A study of the boundary graph classes for colorability problems
• On the number of boundary classes in the 3-colouring problem
• Continuous sets of the boundary classes of graphs for coloring problems
• Boundary properties of graphs for algorithmic graph problems
• Boundary classes of graphs for some recognition problems

Cited in

(7)

• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs
• Continuous sets of the boundary classes of graphs for coloring problems
• On the number of boundary classes in the 3-colouring problem
• 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

This page was built for publication: On intersection and symmetric difference of families of boundary classes in the problems on colouring and on the chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917372)