Generalized H-COLORING and H-covering of trees

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

Volumn 2573 LNCS, Issue , 2002, Pages 198-210

  Fiala, Jiří ^a   Heggernes, Pinar ^b   Kristiansen, Petter ^b   Telle, Jan Arne ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ACYCLIC GRAPHS; GENERALIZED H; GRAPH COVERING; GRAPH G; INPUT GRAPHS; NATURAL NUMBER;

GRAPH THEORY;

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EID: 27844434698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_18     Document Type: Conference Paper

References (14)

1. James Abello, Michael R. Fellows, and John C. Stillwell. On the complexity and combinatorics of covering finite complexes. Australasian Journal of Combinatorics, 4:103-112, 1991.
2. Dana Angluin. Local and global properties in networks of processors (extended abstract). In Conference Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pages 82-93, Los Angeles, California, April 28-30 1980.
3. Norman Biggs. Algebraic Graph Theory. Cambridge University Press, 1974.
4. Hans L. Bodlaender. The classification of coverings of processor networks. Journal of Parallel and Distributed Computing, 6:166-182, 1989.
5. Béla Bollobás. Random Graphs. Academic Press, 1985.
6. Bruno Courcelle and Yves Métivier. Coverings and minors: Applications to local computations in graphs. European Journal of Combinatorics, 15:127-138, 1994.
7. Jiří Fiala and Jan Kratochvíl. Partial covers of graphs. To appear in Discussiones Mathematicae Graph Theory.
8. Jonathan L. Gross and Thomas W. Tucker. Topological Graph Theory. J. Wiley and Sons, 1987.
9. Pavol Hell and Jaroslav Nešetřil. On the complexity of H-colouring. Journal of Combinatorial Theory, Series B, 48(1):92-110, 1990.
10. Jan Kratochvíl, Andrzej Proskurowski, and Jan Arne Telle. Complexity of colored graph covers I. Colored directed multigraphs. In Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG'97, Berlin, Germany, June 18-20 1997, Proceedings, volume 1335 of Lecture Notes in Computer Science, pages 242-257. Springer-Verlag, 1997.
11. Jan Kratochvíl, Andrzej Proskurowski, and Jan Arne Telle. Covering regular graphs. Journal of Combinatorial Theory, Series B, 71(1):1-16, 1997.
12. Jan Kratochvíl, Andrzej Proskurowski, and Jan Arne Telle. Complexity of graph covering problems. Nordic Journal of Computing, 5(3):173-195, 1998.
13. Petter Kristiansen and Jan Arne Telle. Generalized H-coloring of graphs. In Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20 2000, Proceedings, volume 1969 of Lecture Notes in Computer Science, pages 456-466. Springer-Verlag, 2000.
14. William S. Massey. Algebraic Topology: An Introduction. Harcourt, Brace and World, 1967. Reprinted 1977, Springer-Verlag.