Joanna Cyman

collaborators

2 papers

math.CO2017

On accurate domination in graphs

Joanna Cyman, Michael A. Henning, Jerzy Topp

A dominating set of a graph $G$ is a subset $D \subseteq V_{G}$ such that every vertex not in $D$ is adjacent to at least one vertex in $D$ . The cardinality of a smallest dominating…

math.CO2017

Restricted size Ramsey number for $P_{3}$ versus cycles

Joanna Cyman, Tomasz Dzido

Let $F$ , $G$ and $H$ be simple graphs. We say $F \to (G, H)$ if for every $2$ -coloring of the edges of $F$ there exists a monochromatic $G$ or $H$ in $F$ . The Ramsey number…

On accurate domination in graphs

Restricted size Ramsey number for P3​ versus cycles

Restricted size Ramsey number for $P_{3}$ versus cycles