19 citations · 30 across the 14 of their papers we have counts for
1 paper · 2 filters
Matthias Kriesell, Samuel Mohr
It has been conjectured that if a finite graph has a vertex coloring such that the union of any two color classes induces a connected graph, then for every set T of vertices cont…