Monika Rosicka

activity

20132022

most citedGadget structures in proofs of the Kochen-Specker theorem

19 citations · 24 across the 6 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2017

Convex and weakly convex domination in prism graphs

Monika Rosicka

For a given graph $G = (V, E)$ and permutation $π : V \mapsto V$ the prism $π G$ of $G$ is defined as follows: $V (π G) = V (G) \cup V (G^{'})$ , where $G^{'}$ is a copy of $G$ , and $E(πG)=E(G)\cup E(G…

math.CO2016

Permutation graphs and unique games

Monika Rosicka, Simone Severini

We study the value of unique games as a graph-theoretic parameter. This is obtained by labeling edges with permutations. We describe the classical value of a game as well as give a…

math.CO2013

Graphs with $C_3_-free vertices are not universal fixers

Magdalena Lemańska, Monika Rosicka, Rita Zuazua

A non-isolated vertex $x \in V (G)$ is called $C_{3}$ -free if $x$ belongs to no triangle of $G$ . In \cite{BMW} Burger, Mynhardt and Weakley introduced the idea of universal fixers. L…