Pages that link to "Item:Q4297818"

The following pages link to Maximum chromatic polynomials of 2‐connected graphs (Q4297818):

Displaying 11 items.

• Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
• Maximum chromatic polynomial of 3-chromatic blocks (Q1366786) (← links)
• A bibliography on chromatic polynomials (Q1366790) (← links)
• The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
• Extremal bicyclic 3-chromatic graphs (Q2354615) (← links)
• A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
• The 3-connectivity of a graph and the multiplicity of zero ``2'' of its chromatic polynomial (Q2897206) (← links)
• Maximal chromatic polynomials of connected planar graphs (Q3480061) (← links)
• Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
• Upper bounds on the chromatic polynomial of a connected graph with fixed clique number (Q6045139) (← links)
• Independence number and maximal chromatic polynomials of connected graphs (Q6616432) (← links)