English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

In this research we consider minimal hard and boundary classes. These classes are of considerable importance in demarcating the polynomial solvability and the  NP -completeness of problems on graphs in the family of hereditary classes. Earlier it was established that there are no minimal hard classes for a certain type of problems on graphs. Here we find a sufficient condition for existence of such classes. With its use we construct new examples of minimal hard classes and boundary classes for some problems on graphs. We provide complete description of the sets of minimal hard and boundary classes for the problems under consideration. Up to now, no such descriptions were known.

Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs