Pages that link to "Item:Q1382285"
From MaRDI portal
The following pages link to Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285):
Displaying 24 items.
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- Complexity results for equistable graphs and related classes (Q646721) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← links)
- On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs (Q1603536) (← links)
- Stability number in subclasses of \(P_5\)-free graphs (Q1764380) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- Graphs with No Induced Five‐Vertex Path or Antipath (Q2978172) (← links)
- On -sparse graphs and other families (Q3439147) (← links)
