Locally constrained graph homomorphisms-structure, complexity, and applications

Computer Science Review

Volumn 2, Issue 2, 2008, Pages 97-111

  Fiala, Jiří ^a   Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AS GRAPH; COMPLEXITY RESULTS; EDGE PRESERVING; GRAPH HOMOMORPHISMS; GRAPH LABELINGS; ROLE ASSIGNMENT; SURJECTIVE; TWO-GRAPHS;

COMPUTER SCIENCE;

GRAPH THEORY;

EID: 47149094423     PISSN: 15740137     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cosrev.2008.06.001     Document Type: Article

References (59)

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. Angluin D., and Gardiner A. Finite common coverings of pairs of regular graphs. Journal of Combinatorial Theory B 30 (1981) 184-187
4. Archdeacon D. A Kuratowski theorem for the projective plane. Journal of Graph Theory 5 (1981) 243-246
5. Archdeacon D. Two graphs without planar covers. Journal of Graph Theory 41 4 (2002) 318-326
6. Aspvall B., Plass M.F., and Tarjan R.E. A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Information Processing Letters 8 (1979) 121-123
7. Biggs N. Algebraic Graph Theory (1974), Cambridge University Press
8. Bodlaender H.L. The classification of coverings of processor networks. Journal of Parallel and Distributed Computing 6 (1989) 166-182
9. Boldi P., and Vigna S. Fibrations of graphs. Discrete Mathematics 243 1-3 (2002) 21-66
10. J. Chalopin, D. Paulusma, Graph labelings derived from models in distributed computing, in: Fomin [27], pp. 301-312
11. Corneil D., and Gotlieb C. An efficient algorithm for graph isomorphism. Journal of the Association for Computing Machinery 17 (1970) 51-64
12. D.G. Corneil, Graph Isomorphism, Ph.D. Thesis, University of Toronto, 1968
13. Courcelle B., and Métivier Y. Coverings and minors: Applications to local computations in graphs. European Journal of Combinatorics 15 (1994) 127-138
14. Cvetković D.M., Doob M., and Sachs H. Spectra of Graphs-Theory and Application. Pure and Applied Mathematics vol. 87 (1980), Academic Press Inc, New York
15. Djoković D.Ž. Automorphisms of graphs and coverings. Journal of Combinatorial Theory B 16 (1974) 243-247
16. Everett M.G., and Borgatti S. Role colouring a graph. Mathematical Social Sciences 21 2 (1991) 183-188
17. Feder T., and Vardi M.Y. The computational structure of momotone monadic SNP andconstraint satisfaction: A study through datalog and group theory. SIAM Journal of Computing 1 (1998) 57-104
18. M. Fellows, Planar emulators and planar covers, manuscript, 1989
19. J. Fiala, Graph covers, Master's thesis, Charles University, Prague, 1997 (in Czech)
20. Fiala J., and Kratochvíl J. Complexity of partial covers of graphs. In: Eades P., and Takaoka T. (Eds). ISAAC. Lecture Notes in Computer Science vol. 2223 (2001), Springer 537-549
21. Fiala J., and Kratochvíl J. Partial covers of graphs. Discussiones Mathematicae Graph Theory 22 (2002) 89-99
22. J. Fiala, J. Kratochvíl, Locally injective graph homomorphism: Lists guarantee dichotomy, in: Fomin [27], pp. 15-26
23. Fiala J., Kratochvíl J., and Kloks T. Fixed-parameter complexity of λ-labelings. Discrete Applied Mathematics 113 1 (2001) 59-72
24. Fiala J., Kratochvíl J., and Pór A. On the computational complexity of partial covers of theta graphs. Discrete Applied Mathematics 156 (2008) 1143-1149
25. Fiala J., and Maxová J. Cantor-Bernstein type theorem for locally constrained graph homomorphisms. European Journal of Combinatorics 7 27 (2006) 1111-1116
26. Fiala J., and Paulusma D. A complete complexity classification of the role assignment problem. Theoretical Computer Science 1 349 (2005) 67-81
27. Graph-theoretic concepts in computer science. In: Fomin F.V. (Ed). 32nd International Workshop. WG 2006, Bergen, Norway, June 22-24, 2006. Lecture Notes in Computer Science vol. 4271 (2006), Springer Revised Papers (2006)
28. Gardiner A. Antipodal covering graphs. Journal of Combinatorial Theory B 16 (1974) 255-273
29. Godsil C., and Royle G. Algebraic Graph Theory. Graduate Texts in Mathematics vol. 207 (2001), Springer, New York
30. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance 2. SIAM Journal on Discrete Mathematics 5 4 (1992) 586-595
31. Gross J.L., and Tucker T.W. Generating all graph coverings by permutation voltage assignments. Discrete Mathematics 18 (1977) 273-283
32. Grothendieck A. Technique de descente et théorèmes d'existence en géométrie algébrique. I: Généralités. Descente par morphismes fidèlement plats. Séminaire Bourbaki 12 (1959/60) 190 1960
33. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford University Press
34. 4, 4 - e has no finite planar cover. Journal of Graph Theory 21 1 (1998) 51-60
35. Hliněný P., and Thomas R. On possible counterexamples to Negami's planar cover conjecture. Journal of Graph Theory 46 3 (2004) 183-206
36. Hopcroft J. An n log n algorithm for minimizing states in a finite automaton. Theory of Machines and Computations (1971), Academic Press 189-196
37. Kratochvíl J., Proskurowski A., and Telle J.A. Covering directed multigraphs I. colored directed multigraphs. In: Möhring R.H. (Ed). WG (1997). Lecture Notes in Computer Science vol. 1335 (1997), Springer 242-257
38. J. Kratochvíl, A. Proskurowski, J.A. Telle, Covering directed multigraphs II. when 2-SAT helps. Tech. Rep. 1997-354, KAM-DIMATIA Preprint Series, 1997
39. Kratochvíl J., Proskurowski A., and Telle J.A. Covering regular graphs. Journal of Combinatorial Theory, Series B 71 1 (1997) 1-16
40. Kratochvíl J., Proskurowski A., and Telle J.A. Complexity of graph covering problems. Nordic Journal of Computing 5 (1998) 173-195
41. Kristiansen P., and Telle J.A. Generalized H-coloring of graphs. In: Lee D.T., and Teng S.-H. (Eds). ISAAC (2000). Lecture Notes in Computer Science vol. 1969 (2000), Springer 456-466
42. Leese R.A., and Noble S.D. Cyclic labellings with constraints at two distances. Electronic Journal of Combinatorics 11 1 (2004)
43. Leighton F.T. Finite common coverings of graphs. Journal of Combinatorial Theory B 33 (1982) 231-238
44. Lerner J. Role assignments. Network Analysis: Methodological Foundations. In: Brandes U., and Erlebach T. (Eds). Lecture Notes in Computer Science vol. 3418 (2005), Springer 216-252
45. Litovsky I., Métivier Y., and Zielonka W. The power and the limitations of local computations on graphs. In: Mayr E.W. (Ed). WG (1992). Lecture Notes in Computer Science vol. 657 (1992), Springer 333-345
46. Liu D.D.-F., and Zhu X. Circulant distant two labeling and circular chromatic number. Ars Combinatoria 69 (2003) 177-183
47. Lovász L. Combinatorial Problems and Exercises (1979), Akadémiai Kiadó, Budapest
48. B.D. McKay, Nauty (No AUTomorphisms, Yes?). http://cs.anu.edu.au/~bdm/nauty/
49. B.D. McKay, Backtrack programming and the graph isomorphism problem. Master's thesis, University of Melbourne, 1974
50. McKay B.D. Practical graph isomorphism. Congressus Numerantium 30 (1981) 45-87
51. Mohar B. A common cover of graphs and 2-cell embeddings. Journal of Combinatorial Theory, Series B 40 (1986) 94-106
52. Mohar B., and Thomassen C. Graphs on Surfaces (2001), Johns Hopkins University Press, Baltimore
53. Negami S. Graphs which have no planar covering. Bulletin of the Institute of Mathematics, Academia Sinica 4 (1988) 377-384
54. Nešetřil J. Homomorphisms of derivative graphs. Discrete Mathematics 1 3 (1971) 257-268
55. Petersen J. Die Theorie der regulären Graphs. Acta Mathematica XV (1891) 193-220
56. Reidemeister K. Einführung in die kombinatorische Topologie (1932), Braunschweig: Friedr, Vieweg & Sohn A.-G. XII, 209 S
57. Robertson N., and Seymour P.D. Graph minors XX. Wagner's conjecture. Journal of Combinatorial Theory Series B 92 2 (2004) 325-357
58. Sachs H. Simultane überlagerung gegebener graphen. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, Series A 9 (1964) 415-427
59. Stallings J.R. Topology of finite graphs. Inventiones Mathematicae 71 (1983) 551-566