On 3-Coloring of ( [Formula: see text] )-Free Graphs
{{output}}
The 3-coloring of hereditary graph classes has been a deeply-researched problem in the last decade. A hereditary graph class is characterized by a (possibly infinite) list of minimal forbidden induced subgraphs H 1 , H 2 , … ; the graphs in the class a... ...
