Pages that link to "Item:Q3057613"
From MaRDI portal
The following pages link to Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs (Q3057613):
Displaying 5 items.
- Updating the complexity status of coloring graphs without a fixed induced linear forest (Q764301) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- The complexity of \(G\)-free colourability (Q1356726) (← links)
- \textsf{PSPACE}-hardness of variants of the graph coloring game (Q2078618) (← links)
- Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529) (← links)