Csilla Bujtás

activity

20132026

most citedDomination game on forests

3 citations · 12 across the 19 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015★ 2 cited

$F$ -WORM colorings: Results for 2-connected graphs

Csilla Bujtás, Zsolt Tuza

Given two graphs $F$ and $G$ , an $F$ -WORM coloring of $G$ is an assignment of colors to its vertices in such a way that no $F$ -subgraph of $G$ is monochromatic or rainbow. If $G$ h…

math.CO2015

$K_{3}$ -WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum

Csilla Bujtás, Zsolt Tuza

A $K_{3}$ -WORM coloring of a graph $G$ is an assignment of colors to the vertices in such a way that the vertices of each $K_{3}$ -subgraph of $G$ get precisely two colors. We study gra…

F-WORM colorings: Results for 2-connected graphs

K3​-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum

$F$ -WORM colorings: Results for 2-connected graphs

$K_{3}$ -WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum