Minimal sense of direction and decision problems for Cayley graphs
From MaRDI portal
(Redirected from Minimal sense of direction and decision problems for Cayley graphs)
Recommendations
Cites work
Cited in
(12)- Symmetries and sense of direction in labeled graphs
- Coverings that preserve sense of direction
- Lower bounds for weak sense of direction
- Sense of direction in distributed computing
- Sorting on graphs by adjacent swaps using permutation groups
- scientific article; zbMATH DE number 1696678 (Why is no real title available?)
- Minimal sense of direction in regular networks
- scientific article; zbMATH DE number 1151833 (Why is no real title available?)
- Complexity of Deciding Sense of Direction
- Lower bounds for sense of direction in regular graphs
- Minimal Chordal Sense of Direction and Circulant Graphs
- Weak sense of direction labelings and graph embeddings
This page was built for publication: Minimal sense of direction and decision problems for Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293153)