Fibrations of graphs

@article{Boldi2002FibrationsOG,
  title={Fibrations of graphs},
  author={Paolo Boldi and Sebastiano Vigna},
  journal={Discrete Mathematics},
  year={2002},
  volume={243},
  pages={21-66}
}
A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. This paper develops systematically the theory of graph fibrations, emphasizing in particular those results that recently found application in the theory of distributed systems. 
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Figures, tables, and topics from this paper.
36 Citations
39 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 39 references

Computing the characteristic polynomial of a graph

  • Allen J. Schwenk
  • Graphs and Combinatorics,
  • 1974
Highly Influential
4 Excerpts

Spektrum und Automorphismengruppe eines Graphen

  • M. Petersdorf, Horst Sachs
  • In Combinatorial Theory and its Applications, III…
  • 1969
Highly Influential
4 Excerpts

Simultane Überlangerung gegebener Graphen

  • Horst Sachs
  • Magyar Tud. Akad. Mat. Kutató Int. Közl.,
  • 1965
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…