Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs
type: Item
instance of: scholarly article
title: Extremal sets of graphs in the problem of demarcation in the family of hereditary closed classes of graphs
zbMATH Open document ID: 1267.05148
published in: Discrete Mathematics and Applications
publication date: 2013-06-24T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05D05
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 6180062
zbMATH Keywords: NP-completeness
zbMATH Keywords: polynomial solvability
author: D. S. Malyshev
MaRDI profile type: Publication
full work available at URL: dma-2012-041
OpenAlex ID: W1963740847
DOI: 10.1515/DMA-2012-041
Recommended article: Some extremal problems for hereditary properties of graphs
Recommended article: An extremal problem for sets with applications to graph theory
Recommended article: Q3855211
Recommended article: On the structure of hereditary classes of graphs
Recommended article: Hereditary classes of graphs: a parametric approach
Recommended article: Q5477818
Recommended article: On extremal problems of graphs and generalized graphs
Recommended article: Q3476628
Recommended article: Q4056041
Recommended article: On the size of hereditary classes of graphs
description: scientific article; zbMATH DE number 6180062