LATIN 2018: Theoretical Informatics

Abstract

A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The t-tessellability problem aims to decide whether there is a tessellation cover of the graph with t tessellations. This problem is motivated by its applications to quantum walk… (More)
DOI: 10.1007/978-3-319-77404-6

6 Figures and Tables

Topics

  • Presentations referencing similar topics