Complexity of colored graph covers i. Colored directed multigraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1335, Issue , 1997, Pages 242-257

  Kratochvíl, Jan ^a   Proskurowski, Andrzej ^b   Telle, Jan Arne ^c  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF OREGON   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

COVER PROBLEM; COVERING PROBLEMS; GRAPH COVER; GRAPH G; MINIMUM DEGREE; MULTIGRAPHS; UNDIRECTED GRAPH; VERTEX SET;

DIRECTED GRAPHS;

EID: 84901403271     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024502     Document Type: Conference Paper

References (11)

1. J. Abello, M.R. Fellows and J.C. Stillwell, On the complexity and combinatorics of covering finite complexes, Australasian Journal of Combinatorics 4 (1991), 103-112;
2. D. Angluin, Local and global properties in networks of processors, in Proceedings of the 12th ACM Symposium on Theory of Computing (1980), 82-93;
3. D. Angluin and A. Gardner, Finite common coverings of pairs of regular graphs, Journal of Combinatorial Theory B 30 (1981), 184-187;
4. N. Biggs, Algebraic Graph Theory, Cambridge University Press, 1974;
5. M.R. Garey and D.S. Johnson, Computers and Intractability, W.H.Freeman and Co., 1978;
6. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Computing 4 (1981), 718-720;
7. J. Kratochvfl: Regular codes in regular graphs are difficult, Discrete Math. 133 (1994), 191-205
8. J. Kratochvíl, A. Proskurowski, J.A. Telle: On the complexity of graph covering problems, In: Graph-Theoretic Concepts in Computer Science, Proceedings of 20th International Workshop WG'94, Munchen, Germany, 1994, Lecture Notes in Computer Science 903, Springer Verlag, Berlin Heidelberg, 1995, pp. 93-105.
9. J. Kratochvíl, A. Proskurowski, J.A. Telle: Covering regular graphs, to appear in Journal of Combin. Theory Set. B
10. J. Kratochvíl, A. Proskurowski, J.A. Telle: Complexity of colored graph covers II. When 2-SAT helps. (in preparation)
11. J. Kratochvíl, A. Proskurowski, J.A. Telle: Complexity of colored graph covers III. Three-vertex graphs. (in preparation)