Pages that link to "Item:Q5963654"

The following pages link to Two cases of polynomial-time solvability for the coloring problem (Q5963654):

Displaying 29 items.

• The coloring problem for classes with two small obstructions (Q479257) (← links)
• Two complexity results for the vertex coloring problem (Q505438) (← links)
• Critical hereditary graph classes: a survey (Q518125) (← 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)
• 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)
• 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)
• The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
• Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789) (← links)
• Colouring diamond-free graphs (Q2402373) (← links)
• The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) (← links)
• A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← 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)
• The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (Q3540099) (← links)
• Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← 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)
• Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)
• Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
• The chromatic number of (\(P_5\), HVN)-free graphs (Q6639497) (← links)
• A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
• Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable (Q6660054) (← links)