Pages that link to "Item:Q2041989"
From MaRDI portal
The following pages link to Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989):
Displaying 7 items.
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Finding Induced Subgraphs via Minimal Triangulations (Q3113765) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- Planar Induced Subgraphs of Sparse Graphs (Q5250134) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q5875557) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)