Pages that link to "Item:Q1317492"
From MaRDI portal
The following pages link to Coverings and minors: Application to local computations in graphs (Q1317492):
Displaying 11 items.
- Distributed enumeration (Q287005) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Leader election in plane cellular automata, only with left-right global convention (Q596068) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- Covering regular graphs (Q1386472) (← links)
- Checking Global Graph Properties by Means of Local Computations: the Majority Problem (Q4222809) (← links)
- Graph Relabelling Systems (Q4923532) (← links)
- Locally computable enumerations (Q5055920) (← links)
- The Kronecker product and local computations in graphs (Q5878897) (← links)
- Complexity of graph covering problems (Q6184361) (← links)