Pages that link to "Item:Q5311528"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q5311528):
Displaying 4 items.
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- The χt-coloring problem (Q4596640) (← links)