Pages that link to "Item:Q5236261"
From MaRDI portal
The following pages link to Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs (Q5236261):
Displaying 30 items.
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← links)
- Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← links)
- Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
- Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- 1-extendability of independent sets (Q2169951) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← links)
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
- (Q5075768) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five (Q5854894) (← links)
- (Q5874491) (← links)
- (Q5874504) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth (Q6080868) (← links)
- 1-extendability of independent sets (Q6119830) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
- Twin-width. III: Max independent set, min dominating set, and coloring (Q6631356) (← links)
