1 citations · 3 across the 7 of their papers we have counts for
2 papers
math.CO2019★ 1 cited
The domination number of the graph defined by two levels of the -cube, II
József Balogh, Gyula O. H. Katona, William Linz +1
Consider all -element subsets and -element subsets of an -element set as vertices of a bipartite graph. Two vertices are adjacent if the corresponding $\ell…
math.CO2014★ 1 cited
The Disjoint Domination Game
Csilla Bujtás, Zsolt Tuza
We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker…