Extremal \(H\)-colorings of trees and 2-connected graphs (Q345129)
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: Extremal H-colorings of trees and 2-connected graphs |
scientific article; zbMATH DE number 6656192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal \(H\)-colorings of trees and 2-connected graphs |
scientific article; zbMATH DE number 6656192 |
Statements
Extremal \(H\)-colorings of trees and 2-connected graphs (English)
0 references
25 November 2016
0 references
graph homomorphisms
0 references
\(H\)-coloring
0 references
graph coloring
0 references
Widom-Rowlinson model
0 references
London-Hoffman inequality
0 references
2-connected graphs
0 references
0.8806061744689941
0 references
0.839781641960144
0 references
0.8286463618278503
0 references
0.8134893774986267
0 references
