Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree (Q4978445)
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 H‐Colorings of Connected Graphs with Fixed Minimum Degree |
scientific article; zbMATH DE number 6759334
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree |
scientific article; zbMATH DE number 6759334 |
Statements
Maximizing <i>H</i>‐Colorings of Connected Graphs with Fixed Minimum Degree (English)
0 references
10 August 2017
0 references
graph homomorphism
0 references
\(H\)-coloring
0 references
proper coloring
0 references
minimum degree
0 references
\(k\)-connected graph
0 references
0.9517296
0 references
0 references
0.94034266
0 references
0 references
0.90360004
0 references
0.9023684
0 references
0.9009211
0 references
0.8996695
0 references
