Extremal H-colorings of trees and 2-connected graphs
Journal of Combinatorial Theory, Series B(2017)
摘要
For graphs G and H, an H-coloring of G is an adjacency preserving map from the vertices of G to the vertices of H. H-colorings generalize such notions as independent sets and proper colorings in graphs. There has been much recent research on the extremal question of finding the graph(s) among a fixed family that maximize or minimize the number of H-colorings. In this paper, we prove several results in this area.
更多查看译文
关键词
Graph homomorphisms,H-coloring,Graph coloring,Widom–Rowlinson model,London–Hoffman inequality,2-connected graphs
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络