Pages that link to "Item:Q5384003"
From MaRDI portal
The following pages link to Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time (Q5384003):
Displaying 50 items.
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs (Q260042) (← links)
- A new characterization of \(P_k\)-free graphs (Q300476) (← links)
- Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs'' (Q477686) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- A polynomial Turing-kernel for weighted independent set in bull-free graphs (Q521799) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
- Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
- Triangle-free graphs with no six-vertex induced path (Q1637133) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← 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)
- Approximating weighted induced matchings (Q1752475) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Maximum colorful independent sets in vertex-colored graphs (Q1792109) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) (← links)
- On a relation between \(k\)-path partition and \(k\)-path vertex cover (Q2030433) (← 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)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
- A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees (Q2223687) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Polynomial size IP formulations of knapsack may require exponentially large coefficients (Q2661530) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- New Cases of the Polynomial Solvability of the Independent Set Problem for Graphs with Forbidden Paths (Q4558286) (← links)
- Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
- Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
- Independent Feedback Vertex Set for P_5-free Graphs (Q5136232) (← links)
