Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.jctb.2016.09.009 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Graph homomorphisms,H-coloring,Graph coloring,Widom–Rowlinson model,London–Hoffman inequality,2-connected graphs | Discrete mathematics,Combinatorics,Indifference graph,Chordal graph,Cograph,Greedy coloring,Pathwidth,1-planar graph,Pancyclic graph,Triangle-free graph,Mathematics | Journal |
Volume | ISSN | Citations |
122 | 0095-8956 | 4 |
PageRank | References | Authors |
0.56 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Engbers | 1 | 21 | 6.79 |
| David Galvin | 2 | 55 | 11.59 |