Fibrations of graphs

Discrete Mathematics

Volumn 243, Issue 1-3, 2002, Pages 21-66

  Boldi, Paolo ^a   Vigna, Sebastiane ^a  

^a Dipartimento di Scienze dell'Informazione   (Italy)

Author keywords

Graph coverings; Graph factorizations; Graph fibrations

Indexed keywords

EID: 31244432784     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00455-6     Document Type: Article

References (38)

1. Revêtements étales et groupe fondamental, Séminaire de Géométrie Algébrique du Bois Marie 1960-1961 (SGA 1), Dirigé par Alexandre Grothendieck, Augmenté de deux exposés de M. Raynaud, Lecture Notes in Mathematics, Vol. 224, Springer, Berlin, 1971.
2. D. Angluin, Global and local properties in networks of processors, Proceedings of the 12th Symposium on the Theory of Computing, 1980, pp. 82-93.
3. D.R. Bean, Effective coloration, J. Symbolic Logic 41 (2) (1976) 469-480.
4. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
5. P. Boldi, B. Codenotti, P. Gemmell, S. Shammah, J. Simon, S. Vigna, Symmetry breaking in anonymous networks: characterizations, Proceedings of the Fourth Israeli Symposium on Theory of Computing and Systems, IEEE Press, New York, 1996, pp. 16-26.
6. P. Boldi, S. Vigna, Computing vector functions on anonymous networks, in: D. Krizanc, P. Widmayer (Eds.), SIROCCO '97, Proceedings of the Fourth International Colloquium on Structural Information and Communication Complexity, Proceedings in Informatics, Vol. l, Carleton Scientific, Ottawa, Canada, 1997, pp. 201-214, an extended abstract appeared also as a Brief Announcement in Proceedings of PODC '97, ACM Press, New York.
7. P. Boldi, S. Vigna, Self-stabilizing universal algorithms, in: S. Ghosh, T. Herman (Eds.), Self-Stabilizing Systems, Proceedings of the Third Workshop on Self-Stabilizing Systems, Santa Barbara, California, 1997, International Informatics Series, Vol. 7, Carleton University Press, Ottawa, Canada, 1997.
8. F. Borceux, Handbook of Categorical Algebra 1, Encyclopedia of Mathematics and Its Applications, Vol. 50, Cambridge University Press, Cambridge, 1994.
9. F. Borceux, in: Handbook of Categorical Algebra 2, Encyclopedia of Mathematics and Its Applications, Vol. 51, Cambridge University Press, Cambridge, 1994.
10. Younki Chae, Jin Ho Kwak, Jaeun Lee, Characteristic polynomials of some graph bundles, J. Korean Math, Soc. 30 (1) (1993) 229-249.
11. D.M. Cvetkovic, M. Doob, H. Sachs, Spectra of Graphs, Academic Press, New York, 1978.
12. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, 2nd Edition, Addison-Wesley, Reading, MA, 1994.
13. J.W. Gray, Fibred and cofibred categories, Proceedings of the Conference on Categorical Algebra: La Jolla 1965, Springer, Berlin, 1966, pp. 21-83.
14. J.L. Gross, T.W. Tucker, Topological Graph Theory, Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 1987.
15. A. Grothendieck, 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 190 (1959-1960) 299-327.
16. M. Hofmeister, Isomorphisms and automorphisms of graph coverings, Discrete Math. 98 (1991) 175-183.
17. S. Kasangian, S. Vigna, The topos of labelled trees: a categorical semantics for SCCS, Fund. Inform. 32 (1997) 27-45.
18. F.W. Lawvere, Qualitative distinctions between some toposes of generalized graphs, in: Categories in Computer Science and Logic, Boulder, CO, 1987, Contemporary Mathematics, Vol. 92, American Mathematical Society, Providence, RI, 1989.
19. F.T. Leighton, Finite common coverings of graphs, J. Combin. Theory Ser. B 33 (1982) 231-238.
20. C. McLarty, Elementary Categories, Elementary Toposes, Oxford Logic Guides, Vol. 21, Oxford University Press, Oxford, 1992.
21. R. Milner, Communication and Concurrency, International Series in Computer Science, Prentice-Hall, Englewood Cliffs, NJ, 1989.
22. A. Mowshowitz, The adjacency matrix and the group of a graph, in: New Directions in the Theory of Graphs, Proceedings of the Third Ann Arbor Conference on Graph Theory, University of Michigan, Ann Arbor, MI, 1971, Academic Press, New York, 1973, pp. 129-148.
23. N. Norris, Universal covers of graphs: isomorphism to depth n -1 implies isomorphism to all depths, Discrete Appl. Math. 56 (1995) 61-74.
24. O. Ore, in: Theory of Graphs, American Mathematical Society Colloquium Publications, Vol. XXXVIII, American Mathematical Society, Providence, RI, 1962.
25. M. Petersdorf, H. Sachs, Ü. Spektrum,'Automorphismengruppe und Teiler eines Graphen, Wiss. Z. Techn. Hochsch. Ilmenau 15 (1969) 123-128.
26. M. Petersdorf, H. Sachs, Spektrum und Automorphismengruppe eines Graphen, Combinatorial Theory and its Applications, HI, Proceedings of the Colloquium, Balatonfiired, 1969, North-Holland, Amsterdam, 1970, pp. 891-907.
27. T. Pisanski, J. Shawe-Taylor, J. Vrabec, Edge-colorability of graph bundles, J. Combin. Theory Ser. B 35 (1) (1983) 12-19.
28. G. Sabidussi, On a class of fixed-point free graphs, Proc. Amer. Math. Soc. 9 5 (1958) 800-804.
29. H. Sachs, Simultane Überlangerung gegebener Graphen, Magyar Tud. Akad. Mat. Kutatö Int. Közl. 9 (1965) 415-427.
30. H. Sachs, Ü. Teiler, Faktoren und charakteristische Polynome von Graphen, I, Wiss. Z. Techn. Hochsch. Ilmenau 12 (1966) 7-12.
31. A.J. Schwenk, Review No. 8897, Math. Rev. 46 (1973) 1538.
32. A.J. Schwenk, Computing the characteristic polynomial of a graph, in: R.A. Ban, F. Harary (Eds.), Graphs and Combinatorics, Lecture Notes in Mathematics, Vol. 406, Springer, Berlin, 1974, pp. 153-172.
33. J. Shrimpton, Some groups related to the symmetry of a directed graph, J. Pure Appl. Algebra 72 (3) (1991) 303-318.
34. S. Vigna, A guided tour in thé topos of graphs, Technical Report 199-97, Université di Milano, Dipartimento di Scienze dell'Informazione, 1997.
35. O. Wyler, Lecture Notes on Topoi and Quasitopoi, World Scientific, Singapore, 1991.
36. M. Yamashita, T. Kameda, Computing functions on asynchronous anonymous networks, Math. Systems Theory 29 (4) (1996) 331-356.
37. M. Yamashita, T. Kameda, Computing on anonymous networks: Part I -characterizing the solvable cases, IEEE Trans. Parallel Distributed Systems 7 (1) (1996) 69-89.
38. M. Yamashita, T. Kameda, Erratum to computing functions on asynchronous anonymous networks, Theory Comput. Systems (formerly Math. Systems Theory) 31 (1) (1998) 109.