3 citations · 8 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
On vertex coloring without monochromatic triangles
Michał Karpiński, Krzysztof Piecuch
We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. W…
cs.DS2017★ 3 cited
Encoding Cardinality Constraints using Generalized Selection Networks
Michał Karpiński, Marek Piotrów
Boolean cardinality constraints state that at most (at least, or exactly) out of propositional literals can be true. We propose a new class of selection networks that can b…