Maximizing the number of \(x\)-colorings of 4-chromatic graphs (Q1709544)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6856471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the number of \(x\)-colorings of 4-chromatic graphs |
scientific article; zbMATH DE number 6856471 |
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
0.9159600138664246
0 references
0.8496280312538147
0 references
0.8354784846305847
0 references
0.8032406568527222
0 references
