Cantor-Bernstein type theorem for locally constrained graph homomorphisms

European Journal of Combinatorics

Volumn 27, Issue 7, 2006, Pages 1111-1116

  Fiala, Jiří ^a   Maxová, Jana ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748040789     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2006.06.003     Document Type: Article

References (14)

1. Abello J., Fellows M.R., and Stillwell J.C. On the complexity and combinatorics of covering finite complexes. Australian 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, pp. 82-93
3. Biggs N. Algebraic Graph Theory (1974), Cambridge University Press
4. Bodlaender H.L. The classification of coverings of processor networks. Journal of Parallel Distributed Computing 6 (1989) 166-182
5. Courcelle B., and Métivier Y. Coverings and minors: Applications to local computations in graphs. European Journal of Combinatorics 15 (1994) 127-138
6. Everett M.G., and Borgatti S. Role colouring a graph. Mathematical Social Sciences 21 2 (1991) 183-188
7. Fiala J., and Kratochvíl J. Partial covers of graphs. Discussiones Mathematicae Graph Theory 22 (2002) 89-99
8. Fiala J., Kratochvíl J., and Kloks T. Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113 1 (2001) 59-72
9. Gross J.L., and Tucker T.W. Topological Graph Theory (1987), J. Wiley and Sons
10. Kratochvíl J., Proskurowski A., and Telle J.A. Covering directed multigraphs I. colored directed multigraphs. Graph-Theoretical Concepts in Computer Science. 23rd WG'97, Berlin. Lecture Notes in Computer Science vol. 1335 (1997), Springer-Verlag 242-257
11. Kratochvíl J., Proskurowski A., and Telle J.A. Complexity of graph covering problems. Nordic Journal of Computing 5 (1998) 173-195
12. Kristiansen P., and Telle J.A. Generalized H-coloring of graphs. Algorithms and Computation. 11th ISAAC'01, Taipei, Taiwan. Lecture Notes in Computer Science vol. 1969 (2000), Springer-Verlag 456-466
13. Leighton F.T. Finite common coverings of graphs. Journal of Combinatorial Theory, Series B 33 (1982) 231-238
14. Massey W.S. Algebraic Topology: An Introduction (1967), Harcourt, Brace and World