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