Generalized H-coloring and H-covering of trees

Authors:
Jiří Fiala;Pinar Heggernes;Petter Kristiansen;Jan Arne Telle
Affiliations:
DIMATIA and ITI, Charles University, 118 00 Praha 1, Czech Republic;Department of Informatics, University of Bergen, N-5020 Bergen, Norway;Department of Informatics, University of Bergen, N-5020 Bergen, Norway;Department of Informatics, University of Bergen, N-5020 Bergen, Norway
Venue:
Nordic Journal of Computing
Year:
2003

Citing 8
Cited 1

Topological graph theory

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
Covering regular graphs

Journal of Combinatorial Theory Series B
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

Comparing universal covers in polynomial time

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.