Sciweavers

Share
TCS
2016
3 years 2 months ago
Games on interval and permutation graph representations
We describe combinatorial games on graphs in which two players antagonistically build a representation of a subgraph of a given graph. We show that for a large class of these game...
Jessica Enright, Lorna Stewart
TCS
2016
3 years 2 months ago
Computational complexity of covering three-vertex multigraphs
Abstract. A covering projection from a graph G to a graph H is a mapping of the vertices of G to the vertices of H such that, for every vertex v of G, the neighborhood of v is mapp...
Jan Kratochvíl, Jan Arne Telle, Marek Tesar
TCS
2016
3 years 2 months ago
Gray coding cubic planar maps
Abstract. The idea of (combinatorial) Gray codes is to list objects in question in such a way that two successive objects differ in some pre-specified small way. In this paper, w...
Sergey V. Avgustinovich, Sergey Kitaev, Vladimir N...
books