Pages that link to "Item:Q505438"

The following pages link to Two complexity results for the vertex coloring problem (Q505438):

Displaying 23 items.

• Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time (Q417995) (← links)
• Polynomial cases for the vertex coloring problem (Q666663) (← links)
• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem (Q831124) (← links)
• Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time (Q848637) (← links)
• Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180) (← links)
• The vertex coloring problem and its generalizations (Q1022440) (← links)
• The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← links)
• On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
• Parameterized complexity of vertex colouring (Q1811065) (← links)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• Complexity of vertex switching on edge-bicolored graphs (Q2294065) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← 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)
• Complete complexity dichotomy for $7$-edge forbidden subgraphs in the edge coloring problem (Q5090168) (← links)
• Efficient solvability of the weighted vertex coloring problem for some two hereditary graph classes (Q5100120) (← links)
• (Q5866345) (← links)
• Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
• Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)
• A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)