Topological graph theory
The classification of coverings of processor networks
Journal of Parallel and Distributed Computing
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Coverings and minors: application to local computations in graphs
European Journal of Combinatorics
Journal of Combinatorial Theory Series B
Complexity of graph covering problems
Nordic Journal of Computing
Generalized H-Coloring of Graphs
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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
A complete complexity classification of the role assignment problem
Theoretical Computer Science - Graph colorings
Locally constrained graph homomorphisms and equitable partitions
European Journal of Combinatorics
The computational complexity of the role assignment problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.00 |
We study H(p, q)-colorings of graphs, for H a fixed simple graph and p, q natural numbers, a generalization of various other vertex partitioning concepts such as H-covering. An H-cover of a graph G is a local isomorphism between G and H, and the complexity of deciding if an input graph G has an H-cover is still open for many graphs H. In this paper we show that the complexity of H(2p, q)-COLORING is directly related to these open graph covering problems, and answer some of them by resolving the complexity of H(p, q)-COLORING for all acyclic graphs H and all values of p and q.