3 papers
cs.DM2018
Recognizing Graph Search Trees
Jesse Beisegel, Carolin Denkert, Ekkehard Köhler +4
Graph searches and the corresponding search trees can exhibit important structural properties and are used in various graph algorithms. The problem of deciding whether a given span…
cs.DC2018
Positive Aging Admits Fast Asynchronous Plurality Consensus
Gregor Bankhamer, Robert Elsässer, Dominik Kaaser +1
We study distributed plurality consensus among nodes, each of which initially holds one of opinions. The goal is to eventually agree on the initially dominant opinion. We c…
math.CO2008
Cyclic colorings of plane graphs with independent faces
Jernej Azarija, Daniel Král', Rok Erman +2
Let G be a plane graph with maximum face size D. If all faces of G with size four or more are vertex disjoint, then G has a cyclic coloring with D+1 colors, i.e., a coloring such t…