Pages that link to "Item:Q1784741"

The following pages link to On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741):

Displaying 8 items.

• Mind the independence gap (Q776261) (← links)
• Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
• On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
• On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
• Recognizing well-dominated graphs is coNP-complete (Q6072202) (← links)
• On the complexity of coloring ‐graphs (Q6092550) (← links)
• Computing well-covered vector spaces of graphs using modular decomposition (Q6184796) (← links)
• Three remarks on \(\mathbf{W}_{\mathbf{2}}\) graphs (Q6201337) (← links)