Pages that link to "Item:Q764907"

The following pages link to Colouring vertices of triangle-free graphs without forests (Q764907):

Displaying 29 items.

• Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
• The coloring problem for classes with two small obstructions (Q479257) (← links)
• On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) (← links)
• Improved complexity results on \(k\)-coloring \(P_t\)-free graphs (Q499486) (← links)
• Two complexity results for the vertex coloring problem (Q505438) (← links)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• List coloring in the absence of a linear forest (Q2258070) (← links)
• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
• Colouring diamond-free graphs (Q2402373) (← links)
• Bounding clique-width via perfect graphs (Q2424685) (← links)
• Coloring graphs without short cycles and long induced paths (Q2440105) (← links)
• List coloring in the absence of two subgraphs (Q2636800) (← links)
• The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343) (← 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)
• On star and biclique edge-colorings (Q2968507) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← 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)
• $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
• Two cases of polynomial-time solvability for the coloring problem (Q5963654) (← links)
• Bounding the clique-width of \(H\)-free split graphs (Q5965534) (← links)
• Bounding the mim‐width of hereditary graph classes (Q6056798) (← links)
• Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
• Bounding the Mim-Width of Hereditary Graph Classes. (Q6089650) (← links)