Office: Katharine Reed Cudahy Hall,
Room 324
Phone: (414) 288-6880
E-mail:
john.engbers@marquette.edu
John Engbers. Extremal H-colorings of graphs with fixed minimum degree. Journal of Graph Theory 79. (2015): 103-124.
John Engbers, David Galvin, and Justin Hilyard. Combinatorially interpreting generalized Stirling numbers. European J. Combin. 43 (2015) 32-54.
John Engbers and Adam Hammett. Trivial meet and join within the lattice of monotone triangles. Electronic J. Combin. 21(3) (2014) #P3.13.
John Engbers and David Galvin. Counting Independent Sets of a Fixed Size in Graphs with Given Minimum Degree. J. Graph Theory 76 (2014), 149-168.
John Engbers and David Galvin. H-coloring tori. J. Combin. Theory Ser. B 102 (2012), 1110-1133.
John Engbers and David Galvin. H-coloring bipartite graphs. J. Combin. Theory Ser. B 102 (2012), 726-742.