Finite common coverings of graphs
From MaRDI portal
Publication:1165857
DOI10.1016/0095-8956(82)90042-9zbMath0488.05033OpenAlexW2077744016MaRDI QIDQ1165857
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items
Counting commensurability classes of hyperbolic manifolds, Tight products and graph expansion, Fractional isomorphism of graphs, Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths, Quasi-isometric classification of non-geometric 3-manifold groups, Cantor--Bernstein type theorem for locally constrained graph homomorphisms, Isospectral Cayley graphs of some finite simple groups, Commensurability and separability of quasiconvex subgroups., Leighton's theorem : extensions, limitations and quasitrees, Uniform Tree Lattices, List covering of regular multigraphs, Graph isomorphism, color refinement, and compactness, On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues, Locally injective \(k\)-colourings of planar graphs, Comparing Universal Covers in Polynomial Time, List covering of regular multigraphs with semi-edges, Locally constrained graph homomorphisms and equitable partitions, Quasi-isometries between groups with two-ended splittings, Complexity of graph covering problems, Commensurability of lattices in right-angled buildings, Detecting a subclass of torsion-generated groups, Locally constrained graph homomorphisms -- structure, complexity, and applications, Stability properties of multiplicative representations of the free group, Multiple Kronecker covering graphs, Finite Characterization of the Coarsest Balanced Coloring of a Network, Expansion of random graphs: new proofs, new results, On groups and simplicial complexes, Covering theory for graphs of groups, On Leighton's graph covering theorem, Eigenvalues of graphs and a simple proof of a theorem of Greenberg, Commensurability of graph products, Revisiting Leighton’s theorem with the Haar measure, Computing on a partially eponymous ring, Universality of intervals of line graph order, Some geometric aspects of graphs and their eigenfunctions, Quasi‐isometric groups with no common model geometry, Generalized Baumslag-Solitar groups: rank and finite index subgroups, Not every uniform tree covers Ramanujan graphs, On the local geometry of graphs in terms of their spectra, Non-Sunada graphs, Coverings of Configurations, Prime Configurations, and Orbiconfigurations, On the Vanishing of Discrete Singular Cubical Homology for Graphs, 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), Small non-Leighton two-complexes
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
