Pages that link to "Item:Q1384128"

The following pages link to Bounds to the chromatic polynomial of a graph (Q1384128):

Displaying 9 items.

• On the absolute sum of chromatic polynomial coefficient of graphs (Q539349) (← links)
• Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
• A bound on the total chromatic number (Q1297726) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• Bounds for the chromatic number of graphs with partial information (Q1869218) (← links)
• On bounding the chromatic number of L-graphs (Q1918550) (← links)
• The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
• Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)
• Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)