7 citations · 10 across the 3 of their papers we have counts for
4 papers
Triangle-degree and triangle-distinct graphs
Zhanar Berikkyzy, Beth Bjorkman, Heather Smith Blake +5
Let be a simple graph and be a vertex of . The triangle-degree of in is the number of triangles that contain . While every graph has at least two vertices wit…
Choosability with union separation
Mohit Kumbhat, Kevin Moss, Derrick Stolee
List coloring generalizes graph coloring by requiring the color of a vertex to be selected from a list of colors specific to that vertex. One refinement of list coloring, called ch…
(4,2)-choosability of planar graphs with forbidden structures
Zhanar Berikkyzy, Christopher Cox, Michael Dairyko +8
All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lis…
Supercongruences and Complex Multiplication
Jonas Kibelbek, Ling Long, Kevin Moss +2
We study congruences involving truncated hypergeometric series of the form_rF_{r-1}(1/2,...,1/2;1,...,1;λ)_{(mp^s-1)/2} = \sum_{k=0}^{(mp^s-1)/2} ((1/2)_k/k!)^r λ^k where p is a pr…