Fibrations of graphs
From MaRDI portal
A fibration of graphs is a morphism that is a local ismorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. The authors develop systematically the theory of graph fibrations, with a special emphasis on results related to some applications in computer science. In particular, they pay attention to the mutual relations between fibrations, group actions, and categorial constructions. A lot of open problems were also presented.
Recommendations
Cited in
(47)- Computing on a partially eponymous ring
- Holomorphic fiberings of pseudoconcave graphs.
- Networks of open systems
- Slow continued fractions, transducers, and the Serret theorem
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds
- Election in partially anonymous networks with arbitrary knowledge in message passing systems
- Classification of dicoverings
- Spectral rank monotonicity on undirected networks
- State graphs and fibered state surfaces
- Distinguishing views in symmetric networks: a tight lower bound
- Simple agents learn to find their way: an introduction on mapping polygons
- Voltage lifts of graphs from a category theory viewpoint
- Setting ports in an anonymous network: how to reduce the level of symmetry?
- Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Folding and unfolding phylogenetic trees and networks
- Graph fibrations, graph isomorphism, and PageRank
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Bi-resolving graph homomorphisms and extensions of bi-closing codes
- Drawing maps with advice
- Necessary conditions for extended noncontextuality in general sets of random variables
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Characterization of fundamental networks
- Quasifibrations of graphs to find symmetries and reconstruct biological networks
- Equivalent conditions for digital covering maps
- Bifurcations on fully inhomogeneous networks
- Universal dynamic synchronous self-stabilization
- Approximate lumpability for Markovian agent-based models using local symmetries
- Mapping a Polygon with Holes Using a Compass
- Snap-stabilizing tasks in anonymous networks
- The power of small coalitions under two-tier majority on regular graphs
- Unfoldings and Coverings of Weighted Graphs
- Hypernetworks: Cluster Synchronization Is a Higher-Order Effect
- Stable Synchronous Propagation of Signals by Feedforward Networks
- Cohomology of GKM fiber bundles
- Classification of 2-node excitatory-inhibitory networks
- Groupoids, fibrations, and balanced colorings of networks
- Certain subgroups of fundamental group of graphs
- Brief announcement: Know your audience. Communication model and computability in anonymous networks
- A novel approach to covers of multigraphs with semi-edges
- Higher-order interactions lead to `reluctant' synchrony breaking
- On regular trees defined from unfoldings and coverings
- Reflexive graph lenses in univalent foundations
- Graph fibrations and symmetries of network dynamics
- Mapping a polygon with holes using a compass
- Homomorphisms, representations and characteristic polynomials of digraphs
- Election and rendezvous with incomparable labels
This page was built for publication: Fibrations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5957696)
