Startseite Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

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

  • D. S. Malyshev
Veröffentlicht/Copyright: 22. Juni 2013
Veröffentlichen auch Sie bei De Gruyter Brill

Abstract

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.

Published Online: 2013-06-22
Published in Print: 2012-10

© 2013 by Walter de Gruyter GmbH & Co.

Heruntergeladen am 25.9.2025 von https://www.degruyterbrill.com/document/doi/10.1515/dma-2012-041/html
Button zum nach oben scrollen