Pages that link to "Item:Q1366786"
From MaRDI portal
The following pages link to Maximum chromatic polynomial of 3-chromatic blocks (Q1366786):
Displaying 9 items.
- Extremizing first eigenvalue of 3-colored digraphs made with given blocks (Q277134) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
- New bounds for chromatic polynomials and chromatic roots (Q2352058) (← links)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Maximal chromatic polynomials of connected planar graphs (Q3480061) (← links)
- Maximum chromatic polynomials of 2‐connected graphs (Q4297818) (← 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)