Pages that link to "Item:Q2345603"

The following pages link to Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603):

Displayed 22 items.

• On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) ‎ (← links)
• Two complexity results for the vertex coloring problem (Q505438) ‎ (← 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)
• A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) ‎ (← links)
• Star coloring of certain graph classes (Q1706426) ‎ (← 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)
• The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs (Q2409536) ‎ (← links)
• Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) ‎ (← links)
• Graphs with No Induced Five‐Vertex Path or Antipath (Q2978172) ‎ (← 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)
• 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)
• $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) ‎ (← links)
• Clique‐width: Harnessing the power of atoms (Q6062871) ‎ (← links)