Finite common coverings of pairs of regular graphs

DOI10.1016/0095-8956(81)90062-9zbMath0426.05044OpenAlexW2029782393MaRDI QIDQ1135865

S. H. Smith

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90062-9

zbMATH Keywords

universal coveringfinite regular graphsfinite common covering

Mathematics Subject Classification ID

Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items (24)

Counting commensurability classes of hyperbolic manifolds ⋮ Tight products and graph expansion ⋮ Commensurability and separability of quasiconvex subgroups. ⋮ Covering regular graphs ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Unfoldings and Coverings of Weighted Graphs ⋮ Locally constrained graph homomorphisms and equitable partitions ⋮ Complexity of graph covering problems ⋮ Finite common coverings of graphs ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ On Leighton's graph covering theorem ⋮ Computing role assignments of chordal graphs ⋮ Comparing universal covers in polynomial time ⋮ Revisiting Leighton’s theorem with the Haar measure ⋮ Some geometric aspects of graphs and their eigenfunctions ⋮ Super strong ETH is true for PPSZ with small resolution width ⋮ Non-Sunada graphs ⋮ Coverings of Configurations, Prime Configurations, and Orbiconfigurations ⋮ Cayley maps ⋮ A common cover of graphs and 2-cell embeddings ⋮ Two generalisations of Leighton's theorem (with an appendix by Giles Gardam and Daniel J. Woodhouse) ⋮ Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree ⋮ The Kronecker product and local computations in graphs ⋮ A complete complexity classification of the role assignment problem

Cites Work

• Every connected regular graph of even degree is a Schreier coset graph
• Generating all graph coverings by permutation voltage assignments
• Antipodal covering graphs
• Double covers of graphs
• Kronecker Products and Local Joins of Graphs
• Antipodal Embeddings of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite common coverings of pairs of regular graphs