Pages that link to "Item:Q393895"

The following pages link to Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895):

Displaying 7 items.

• Two complexity results for the vertex coloring problem (Q505438) (← links)
• Classifying the clique-width of \(H\)-free bipartite graphs (Q906431) (← links)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
• Towards an isomorphism dichotomy for hereditary graph classes (Q1693994) (← links)
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
• Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)
• Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)