Finite common coverings of graphs

DOI10.1016/0095-8956(82)90042-9zbMath0488.05033MaRDI QIDQ1165857

Frank Thompson Leighton

Publication date: 1982

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(82)90042-9

zbMATH Keywords

universal cover; degree refinement

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

57M15: Relations of low-dimensional topology with graph theory

Related Items

Commensurability of graph products, Covering theory for graphs of groups, Cantor--Bernstein type theorem for locally constrained graph homomorphisms, Isospectral Cayley graphs of some finite simple groups, Commensurability and separability of quasiconvex subgroups., Multiple Kronecker covering graphs, A common cover of graphs and 2-cell embeddings, Some geometric aspects of graphs and their eigenfunctions, Non-Sunada graphs, Fractional isomorphism of graphs, Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths, Not every uniform tree covers Ramanujan graphs, Locally constrained graph homomorphisms and equitable partitions, Eigenvalues of graphs and a simple proof of a theorem of Greenberg, Uniform Tree Lattices, Comparing Universal Covers in Polynomial Time

Cites Work

• Unnamed Item
• Unnamed Item
• Finite common coverings of pairs of regular graphs
• 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