Finite common coverings of graphs
From MaRDI portal
Cites work
- Antipodal covering graphs
- Antipodal Embeddings of Graphs
- Double covers of graphs
- Every connected regular graph of even degree is a Schreier coset graph
- Finite common coverings of pairs of regular graphs
- Generating all graph coverings by permutation voltage assignments
- scientific article; zbMATH DE number 3657847 (Why is no real title available?)
- scientific article; zbMATH DE number 3246034 (Why is no real title available?)
- Kronecker Products and Local Joins of Graphs
Cited in
(55)- Computing on a partially eponymous ring
- 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
- Detecting a subclass of torsion-generated groups
- On groups and simplicial complexes
- Two generalisations of Leighton's theorem (with an appendix by Giles Gardam and Daniel J. Woodhouse)
- Leighton's theorem : extensions, limitations and quasitrees
- List covering of regular multigraphs
- On the local geometry of graphs in terms of their spectra
- Counting commensurability classes of hyperbolic manifolds
- Graph isomorphism, color refinement, and compactness
- Locally constrained graph homomorphisms and equitable partitions
- Eigenvalues of graphs and a simple proof of a theorem of Greenberg
- On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues
- Tight products and graph expansion
- Quasi-isometric classification of non-geometric 3-manifold groups
- Uniform Tree Lattices
- Comparing Universal Covers in Polynomial Time
- Locally injective k-colourings of planar graphs
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Revisiting Leighton’s theorem with the Haar measure
- Expansion of random graphs: new proofs, new results
- Quasi-isometric groups with no common model geometry
- Coverings of configurations, prime configurations, and orbiconfigurations
- Finite characterization of the coarsest balanced coloring of a network
- On Leighton's graph covering theorem
- Quasi-isometries between groups with two-ended splittings
- Stability properties of multiplicative representations of the free group
- On the vanishing of discrete singular cubical homology for graphs
- Small non-Leighton two-complexes
- Commensurability of graph products
- List covering of regular multigraphs with semi-edges
- Complexity of graph covering problems
- Commensurability of lattices in right-angled buildings
- Groupoids, fibrations, and balanced colorings of networks
- The fundamental group in discrete homotopy theory
- Forester's lattices and small non-leighton complexes
- Covering theory for graphs of groups
- Computational complexity of covering multigraphs with semi-edges: small cases
- Tiny non-Leighton complexes
- Perfect colourings of hypergraphs
- A novel approach to covers of multigraphs with semi-edges
- The Sherali-Adams and Weisfeiler-Leman hierarchies in (promise valued) constraint satisfaction problems
- Homotopy covers of graphs
- Computational complexity of covering regular trees
- Universality of intervals of line graph order
- Generalized Baumslag-Solitar groups: rank and finite index subgroups
- 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
This page was built for publication: Finite common coverings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165857)
