9 citations · 20 across the 5 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 4 cited
On the connectivity Waiter-Client game
Sylwia Antoniuk, Codruut Grosu, Lothar Narins
In this short note we consider a variation of the connectivity Waiter-Client game played on an -vertex graph which consists of disjoint spanning…
math.CO2015★ 1 cited
A Density Turán Theorem
Lothar Narins, Tuan Tran
Let be a graph which contains an edge whose deletion reduces its chromatic number. For such a graph a classical result of Simonovits from 1966 shows that every graph on $n…