The following pages link to Sancrey Rodrigues Alves (Q1784740):
Displayed 4 items.
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques (Q2081655) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)