7 citations · 8 across the 9 of their papers we have counts for
5 papers · 1 filter
(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…
Ramsey numbers for partially-ordered sets
Christopher Cox, Derrick Stolee
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize s…
Chvátal-type results for degree sequence Ramsey numbers
Christopher Cox, Michael Ferrara, Ryan M. Martin +1
A sequence of nonnegative integers is graphic if there is a (simple) graph of order having degree sequence . In this case, is said to realize o…
Counting prime juggling patterns
Esther Banaian, Steve Butler, Christopher Cox +3
Juggling patterns can be described by a closed walk in a (directed) state graph, where each vertex (or state) is a landing pattern for the balls and directed edges connect states t…
A generalization of Eulerian numbers via rook placements
Esther Banaian, Steve Butler, Christopher Cox +3
We consider a generalization of Eulerian numbers which count the number of placements of "rooks" on an board where there are exactly rooks in each row and each…