Topological graph theory
The classification of coverings of processor networks
Journal of Parallel and Distributed Computing
Coverings and minors: application to local computations in graphs
European Journal of Combinatorics
Fixed parameter complexity of λ-labelings
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Complexity of graph covering problems
Nordic Journal of Computing
Complexity of Colored Graph Covers I. Colored Directed Multigraphs
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
| Hi-index | 0.00 |
We show that the simultaneous existence of a single locally surjective graph homomorphism between a graph G and a connected and finite graph H together with some locally injective homomorphism between the same pair of graphs assures that both homomorphisms are locally bijective.We give a short proof of this assertion which unifies previously known partial results of this form. We utilize the notion of universal cover, and relate its properties to the notion of degree refinement, which was used as a principal tool in other works.