5 citations · 6 across the 2 of their papers we have counts for
3 papers
math.CO2017★ 5 cited
On accurate domination in graphs
Joanna Cyman, Michael A. Henning, Jerzy Topp
A dominating set of a graph is a subset such that every vertex not in is adjacent to at least one vertex in . The cardinality of a smallest dominating…
math.CO2017★ 1 cited
Restricted size Ramsey number for versus cycles
Joanna Cyman, Tomasz Dzido
Let , and be simple graphs. We say if for every -coloring of the edges of there exists a monochromatic or in . The Ramsey number…
math.CO2014
On-line Ramsey numbers of paths and cycles
Joanna Cyman, Tomasz Dzido, John Lapinskas +1
Consider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builde…