Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree

Authors

John Engbers, Marquette UniversityFollow

Document Type

Article

Publication Date

2024

Publisher

Springer

Source Publication

Graphs and Combinatorics

Source ISSN

0911-0119

Original Item ID

DOI: 10.1007/s00373-024-02854-w

Abstract

For graphs G and H, an H-coloring of G is an adjacency-preserving map from the vertex set of G to the vertex set of H.

Comments

Accepted version. Graphs and Combinatorics, Vol. 40, No. 6 (2024). DOI. © The Author(s), under exclusive licence to Springer Nature Japan KK. Used with permission.

Recommended Citation

Engbers, John, "Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree" (2024). Mathematical and Statistical Science Faculty Research and Publications. 146.
https://epublications.marquette.edu/math_fac/146