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 4 items.
- 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)
- Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)
