Pages that link to "Item:Q5163508"
From MaRDI portal
The following pages link to Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508):
Displaying 6 items.
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- (Q4242799) (← links)
- (Q5874504) (← links)