7 citations · 12 across the 7 of their papers we have counts for
7 papers
Maximizing the number of stars in graphs with forbidden properties
Zhanar Berikkyzy, Kirsten Hogenson, Rachel Kirsch +1
Erdős proved an upper bound on the number of edges in an -vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph famil…
Solving Abalone on Small Boards
Joseph Gutstadt, Kirsten Hogenson, John Koerner
Abalone is a 2-player board game with perfect information. The game is played on a 5x5x5 hexagonal grid and ends when a player pushes 6 of their opponents' pieces off the board. Ab…
Equitable Choosability of Prism Graphs
Kirsten Hogenson, Dan Johnston, Suzanne O'Hara
A graph is equitably -choosable if, for every -uniform list assignment , is -colorable and each color appears on at most vert…
A Note on the Maximum Rectilinear Crossing Number of Spiders
Joshua Fallon, Kirsten Hogenson, Lauren Keough +3
The maximum rectilinear crossing number of a graph is the maximum number of crossings in a good straight-line drawing of in the plane. In a good drawing any two edges inter…
(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…
Rainbow arithmetic progressions
Steve Butler, Craig Erickson, Leslie Hogben +8
In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers and , the expression $aw([n…
Tiling tripartite graphs with 3-colorable graphs: The extreme case
Kirsten Hogenson, Ryan R. Martin, Yi Zhao
There is a sufficiently large such that the following holds. If is a tripartite graph with vertices in each vertex class such that every vertex is adjace…