Pages that link to "Item:Q990082"
From MaRDI portal
The following pages link to Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082):
Displaying 12 items.
- Penta-extensions of hereditary classes of graphs (Q813334) (← links)
- On the stability number of claw-free \(P_5\)-free and more general graphs (Q1302154) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← links)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Towards Erdős-Hajnal for graphs with no 5-hole (Q2288355) (← links)
- Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs (Q2461195) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
