Pages that link to "Item:Q393895"

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

Displaying 21 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)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• Colouring diamond-free graphs (Q2402373) (← links)
• Bounding clique-width via perfect graphs (Q2424685) (← links)
• Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
• Bounding the Clique-Width of H-free Chordal Graphs (Q2946383) (← links)
• Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Colouring square-free graphs without long induced paths. (Q3304134) (← links)
• On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size (Q4973236) (← links)
• Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with $5$-vertex prohibitions (Q5090159) (← links)
• (Q5111290) (← links)
• Clique-Width for Graph Classes Closed under Complementation (Q5112821) (← links)
• Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)
• Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
• Clique‐width: Harnessing the power of atoms (Q6062871) (← links)