The following pages link to (Q5874504):
Displaying 7 items.
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- (Q4242799) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
- Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)
