Pages that link to "Item:Q4608638"
From MaRDI portal
The following pages link to Parameterized Algorithms on Perfect Graphs for Deletion to (r,l)-Graphs (Q4608638):
Displaying 7 items.
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph (Q1784741) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs (Q2958335) (← links)
- (Q5009615) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)
