Library

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Graphs and combinatorics 8 (1992), S. 233-241 
    ISSN: 1435-5914
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract LetX be a connected locally finite transitive graph with polynomial growth. We show that there exist infinitely many finite graphsY 1,Y 2,... such thatX is a covering graph of each of these graphs and everyY k ,k≥2, is covering graph of the graphsY 1,...,Y k-1 . IfX is in additions-transitive for somes≥2 the graphsY i can be assumed to be at leasts-transitive.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...