Pages that link to "Item:Q817767"
From MaRDI portal
The following pages link to On algorithms for (\(P_5\), gem)-free graphs (Q817767):
Displaying 15 items.
- Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- Dominating induced matchings for \(P_7\)-free graphs in linear time (Q476446) (← links)
- Polynomial cases for the vertex coloring problem (Q666663) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- One-three join: a graph operation and its consequences (Q2364085) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs (Q2461195) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
