Critical elements in combinatorially closed families of graph classes

The notions of boundary and minimal hard classes of graphs, united by the term “critical classes,” are useful tools for analysis of computational complexity of graph problems in the family of hereditary graph classes. In this family, boundary classes are known for several graph problems. In the pape...

Ausführliche Beschreibung