Pages that link to "Item:Q2252529"

The following pages link to Closing complexity gaps for coloring problems on \(H\)-free graphs (Q2252529):

Displaying 2 items.

• Solving problems on graphs of high rank-width (Q1709595) (← links)
• Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)