The following pages link to (Q5628155):
Displayed 10 items.
- Maximum number of colourings: 4-chromatic graphs (Q777478) (← links)
- Le nombre maximal de colorations d'un graphe Hamiltonien (Q1232417) (← links)
- Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544) (← links)
- Extremal colorings and independent sets (Q1756103) (← 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)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Brève communication. Une caractérisation des graphes $k-$chromatiques minimaux sans sommet isolé (Q5650702) (← links)
- Upper bounds on the chromatic polynomial of a connected graph with fixed clique number (Q6045139) (← links)