Pages that link to "Item:Q2640610"

The following pages link to Some corollaries of a theorem of Whitney on the chromatic polynomial (Q2640610):

Displaying 9 items.

• Maximizing proper colorings on graphs (Q490999) (← links)
• Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
• A bibliography on chromatic polynomials (Q1366790) (← links)
• The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
• Counting colorings of a regular graph (Q2345527) (← links)
• Optimal graphs for chromatic polynomials (Q2483402) (← links)
• Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
• Maximum number of colorings of (2<i>k, k</i>²)‐graphs (Q5434250) (← links)
• The Extremality of 2-Partite Turán Graphs with Respect to the Number of Colorings (Q6069431) (← links)