Pages that link to "Item:Q5896984"
From MaRDI portal
The following pages link to Exploring the complexity boundary between coloring and list-coloring (Q5896984):
Displayed 7 items.
- Incremental list coloring of graphs, parameterized by conservation (Q391091) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)
- Limited packing and multiple domination problems: polynomial time reductions (Q2448892) (← links)
- An Exact Decomposition Approach for the Real-Time Train Dispatching Problem (Q3195230) (← links)
- On coloring problems with local constraints (Q5891093) (← links)
- On coloring problems with local constraints (Q5891606) (← links)