scientific article; zbMATH DE number 3353319
From MaRDI portal
Publication:5628155
Cited in
(13)- Le nombre maximal de colorations d'un graphe Hamiltonien
- Maximizing the number of x-colorings of 4-chromatic graphs
- Extremal colorings and independent sets
- Maximum number of colourings: 5-chromatic case
- New bounds for chromatic polynomials and chromatic roots
- A proof of Tomescu's graph coloring conjecture
- Tomescu's Graph Coloring Conjecture for \ell-Connected Graphs
- Brève communication. Une caractérisation des graphes k-chromatiques minimaux sans sommet isolé
- Upper bounds on the chromatic polynomial of a connected graph with fixed clique number
- Independence number and maximal chromatic polynomials of connected graphs
- Extremal graphs for Widom-Rowlinson colorings in k-chromatic graphs
- Turán colourings in off-diagonal Ramsey multiplicity
- Maximum number of colourings: 4-chromatic graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5628155)
