Finding large induced sparse subgraphs in <i> c <sub>>t</sub> </i> -free graphs in quasipolynomial time (Q6087005)
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: Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time |
scientific article; zbMATH DE number 7765175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding large induced sparse subgraphs in <i> c <sub>>t</sub> </i> -free graphs in quasipolynomial time |
scientific article; zbMATH DE number 7765175 |
Statements
Finding large induced sparse subgraphs in <i> c <sub>>t</sub> </i> -free graphs in quasipolynomial time (English)
0 references
14 November 2023
0 references
\(C_{>t}\)-free graphs
0 references
\(P_t\)-free graphs
0 references
feedback vertex set
0 references
independent set
0 references
