Pages that link to "Item:Q2548964"

The following pages link to Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph) (Q2548964):

Displayed 9 items.

• Maximum number of colourings: 4-chromatic graphs (Q777478) ‎ (← links)
• Le nombre maximal de colorations d'un graphe Hamiltonien (Q1232417) ‎ (← links)
• Extremal colorings and independent sets (Q1756103) ‎ (← links)
• The maximum number of colorings of graphs of given order and size: a survey (Q2317644) ‎ (← links)
• Maximum number of colourings: 5-chromatic case (Q2323817) ‎ (← links)
• New bounds for chromatic polynomials and chromatic roots (Q2352058) ‎ (← links)
• Extremal bicyclic 3-chromatic graphs (Q2354615) ‎ (← links)
• A proof of Tomescu's graph coloring conjecture (Q2421556) ‎ (← links)
• Upper bounds on the chromatic polynomial of a connected graph with fixed clique number (Q6045139) ‎ (← links)