Pages that link to "Item:Q3480061"
From MaRDI portal
The following pages link to Maximal chromatic polynomials of connected planar graphs (Q3480061):
Displaying 20 items.
- On purely tree-colorable planar graphs (Q280945) (← links)
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- The chromatic connectivity of graphs (Q1110536) (← links)
- \(T\)-chromatic polynomials (Q1343268) (← links)
- Planar graphs with least chromatic coefficients (Q1366785) (← links)
- Maximum chromatic polynomial of 3-chromatic blocks (Q1366786) (← links)
- A bibliography on chromatic polynomials (Q1366790) (← links)
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544) (← links)
- On the maximum number of colorings of a graph (Q1750664) (← links)
- Extremal colorings and independent sets (Q1756103) (← links)
- Some algebraic methods for calculating the number of colorings of a graph (Q1781373) (← 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)
- A proof of Tomescu's graph coloring conjecture (Q2421556) (← links)
- Extremal properties of the chromatic polynomials of connected 3-chromatic graphs (Q2914003) (← links)
- Maximum chromatic polynomials of 2‐connected graphs (Q4297818) (← 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)
