Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disc.2017.09.028 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISC.2017.09.028 / rank | |||
Normal rank | |||
Latest revision as of 05:13, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing the number of \(x\)-colorings of 4-chromatic graphs |
scientific article |
Statements
Maximizing the number of \(x\)-colorings of 4-chromatic graphs (English)
0 references
5 April 2018
0 references
\(x\)-coloring
0 references
chromatic number
0 references
\(k\)-chromatic
0 references
chromatic polynomial
0 references
\(k\)-connected graph
0 references
subdivision
0 references
theta graph
0 references
