Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree (Q6640963)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree |
scientific article; zbMATH DE number 7946947
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree |
scientific article; zbMATH DE number 7946947 |
Statements
Maximizing the number of \(H\)-colorings of graphs with a fixed minimum degree (English)
0 references
20 November 2024
0 references
\(H\)-coloring
0 references
graph homomorphism
0 references
extremal graph
0 references
minimum degree
0 references
0 references
