Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
type: Item
instance of: scholarly article
title: Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
zbMATH Open document ID: 0815.68074
DOI: 10.1016/0166-218X(93)E0133-J
author: N. Norris
published in: Discrete Applied Mathematics
publication date: 1995-02-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 716334
zbMATH Keywords: edge-labeled digraphs
zbMATH Keywords: computer networks
zbMATH Keywords: finite-state machines
MaRDI profile type: Publication
cites work: Computing on an anonymous ring
cites work: Q5639639
cites work: Easy impossibility proofs for distributed consensus problems
cites work: Q4038697
cites work: Finite common coverings of graphs
cites work: Q4044478
cites work: Computing functions on asynchronous anonymous networks
description: scientific article; zbMATH DE number 716334