The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs. (Q6644901)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs. |
scientific article; zbMATH DE number 7950639
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs. |
scientific article; zbMATH DE number 7950639 |
Statements
The feasibility problem: the family \(\mathcal{F}(G)\) of all induced \(G\)-free graphs. (English)
0 references
28 November 2024
0 references
infinite family of graphs
0 references
\(G\)-free graphs
0 references
