Homological Coverings of Graphs
From MaRDI portal
Recommendations
Cited in
(43)- Infinite coverings of cages
- Random walks on the triangular prism and other vertex-transitive graphs
- Polar spaces, generalized hexagons and perfect codes
- q-coverings, codes and line graphs
- The algebra of flows in graphs
- Action graphs and coverings
- Group actions, coverings and lifts of automorphisms
- Covering regular graphs
- Automorphism groups of covering graphs
- Linear criteria for lifting automorphisms of elementary abelian regular coverings
- Homological methods in algebraic map theory.
- Lifting graph automorphisms by voltage assignments
- Coverings and homotopy of a graph
- Computing stable epimorphisms onto finite groups
- Confluence of some presentations associated with graphs
- Locally bi-2-transitive graphs and cycle-regular graphs, and the answer to a 2001 problem posed by Fouquet and Hahn
- Moving homology classes in finite covers of graphs
- Invariant subspaces, duality, and covers of the Petersen graph
- Antipodal covering graphs
- The fundamental group and Galois coverings of hexagonal systems in 3-space
- Presentations for (G, s)-transitive graphs of small valency
- scientific article; zbMATH DE number 4173910 (Why is no real title available?)
- scientific article; zbMATH DE number 637271 (Why is no real title available?)
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- On split liftings with sectional complements
- scientific article; zbMATH DE number 4120203 (Why is no real title available?)
- scientific article; zbMATH DE number 772739 (Why is no real title available?)
- scientific article; zbMATH DE number 867645 (Why is no real title available?)
- Finite covers of graphs, their primitive homology, and representation theory
- On Leighton's graph covering theorem
- Group actions and coverings of Brauer graph algebras
- On the vanishing of discrete singular cubical homology for graphs
- Coverings of graphs and maps, orthogonality, and eigenvectors
- Strong edge colorings of graphs and the covers of Kneser graphs
- Graph Coverings and (Im)primitive Homology: Examples of Low Degree
- Graph coverings and graph labellings
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- Computational complexity of covering coloured mixed multigraphs with simple degree partitions
- Triples and hexagons
- Coverings of general digraphs
- Elementary abelian covers of graphs
- Computational complexity of covering regular trees
- Invariant boundary distributions for finite graphs
This page was built for publication: Homological Coverings of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666879)