Maximizing \(H\)-colorings of a regular graph (Q4920651)
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 6164622
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing \(H\)-colorings of a regular graph |
scientific article; zbMATH DE number 6164622 |
Statements
Maximizing <i>H</i>‐Colorings of a Regular Graph (English)
0 references
21 May 2013
0 references
graph homomorphisms
0 references
graph coloring
0 references
0 references
0.8529141545295715
0 references
0.83355712890625
0 references
0.8297209739685059
0 references
0.8197201490402222
0 references
0.8065516948699951
0 references
