Pages that link to "Item:Q3599143"

The following pages link to A Note on k-Colorability of P 5-Free Graphs (Q3599143):

Displaying 13 items.

• On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
• Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
• \(K_ 5\) is the only double-critical 5-chromatic graph (Q1088672) (← links)
• The total coloring of \(K_5\)-minor-free graphs (Q2122692) (← links)
• Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
• Domination, coloring and stability in \(P_5\)-reducible graphs (Q2341757) (← links)
• Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes (Q2345603) (← links)
• Choosability of P 5-Free Graphs (Q3182940) (← links)
• A (5,5)-Colouring of <i>K</i>_<i>n</i> with Few Colours (Q4554774) (← links)
• (Q5740788) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs (Q6102271) (← links)
• On the chromatic number of (P5,dart)-free graphs (Q6132236) (← links)