Pages that link to "Item:Q6087005"
From MaRDI portal
The following pages link to Finding large induced sparse subgraphs in <i> c <sub>>t</sub> </i> -free graphs in quasipolynomial time (Q6087005):
Displayed 12 items.
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Grid induced minor theorem for graphs of small degree (Q2692786) (← links)
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6039437) (← links)
- Classifying subset feedback vertex set for \(H\)-free graphs (Q6039438) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs (Q6144407) (← links)
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)