Pages that link to "Item:Q1996748"

The following pages link to The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748):

Displaying 7 items.

• Two complexity results for the vertex coloring problem (Q505438) (← links)
• Polynomial cases for the vertex coloring problem (Q666663) (← links)
• Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← links)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
• Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
• Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
• A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)