Name
Abstract | ||
|---|---|---|
A covering projection from a graph G onto a graph H is a mapping of the vertices of G onto the vertices of H such that, for every vertex v of G, the neighborhood of v is mapped bijectively onto the neighborhood of its image. Moreover, if G and H are multigraphs, then this local bijection has to preserve multiplicities of the neighbors as well. The notion of covering projection stems from topology, but has found applications in areas such as the theory of local computation and construction of highly symmetric graphs. It provides a restrictive variant of the constraint satisfaction problem with additional symmetry constraints on the behavior of the homomorphisms of the structures involved. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.tcs.2015.09.013 | Theoretical Computer Science |
Keywords | Field | DocType |
Computational complexity,Graph homomorphism,Covering projection | Discrete mathematics,Combinatorics,Graph power,Graph homomorphism,Graph labeling,Quartic graph,Neighbourhood (graph theory),Cycle graph,Covering graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
609 | P1 | 0304-3975 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan Kratochvíl | 1 | 1751 | 151.84 |
| Jan Arne Telle | 2 | 851 | 80.13 |
| Marek Tesar | 3 | 7 | 1.63 |