Fibrations of graphs

DOI10.1016/S0012-365X(00)00455-6zbMath0988.05073OpenAlexW2078073304MaRDI QIDQ5957696

Sebastiano Vigna, Paolo Boldi

Publication date: 24 June 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00455-6

zbMATH Keywords

graph coveringsgraph factorizationsgraph fibrations

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (40)

Networks of open systems ⋮ Quasifibrations of graphs to find symmetries and reconstruct biological networks ⋮ Folding and unfolding phylogenetic trees and networks ⋮ Equivalent conditions for digital covering maps ⋮ Bi-resolving graph homomorphisms and extensions of bi-closing codes ⋮ Homomorphisms, representations and characteristic polynomials of digraphs ⋮ Necessary conditions for extended noncontextuality in general sets of random variables ⋮ Slow continued fractions, transducers, and the Serret theorem ⋮ The power of small coalitions under two-tier majority on regular graphs ⋮ Unfoldings and Coverings of Weighted Graphs ⋮ Election in partially anonymous networks with arbitrary knowledge in message passing systems ⋮ Bifurcations on Fully Inhomogeneous Networks ⋮ Hypernetworks: Cluster Synchronization Is a Higher-Order Effect ⋮ Stable Synchronous Propagation of Signals by Feedforward Networks ⋮ Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and Uncertainty ⋮ Drawing maps with advice ⋮ Voltage lifts of graphs from a category theory viewpoint ⋮ Classification of dicoverings ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Simple agents learn to find their way: an introduction on mapping polygons ⋮ Labelled (Hyper)Graphs, Negotiations and the Naming Problem ⋮ Universal dynamic synchronous self-stabilization ⋮ Cohomology of GKM fiber bundles ⋮ Election and rendezvous with incomparable labels ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Computing on a partially eponymous ring ⋮ Classification of 2-node excitatory-inhibitory networks ⋮ Characterization of fundamental networks ⋮ Snap-stabilizing tasks in anonymous networks ⋮ Groupoids, fibrations, and balanced colorings of networks ⋮ Graph fibrations and symmetries of network dynamics ⋮ Mapping a polygon with holes using a compass ⋮ Certain subgroups of fundamental group of graphs ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification ⋮ Approximate lumpability for Markovian agent-based models using local symmetries ⋮ Setting Ports in an Anonymous Network: How to Reduce the Level of Symmetry? ⋮ Spectral rank monotonicity on undirected networks ⋮ Mapping a Polygon with Holes Using a Compass ⋮ Graph fibrations, graph isomorphism, and PageRank ⋮ Distinguishing views in symmetric networks: a tight lower bound

This page was built for publication: Fibrations of graphs