The following pages link to (Q5075768):
Displaying 6 items.
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- (Q4242799) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide (Q5229535) (← links)
- (Q5874504) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
