Pages that link to "Item:Q5940668"
From MaRDI portal
The following pages link to Recognizing circulant graphs in polynomial time: An application of association schemes (Q5940668):
Displaying 10 items.
- Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
- Finding a cycle base of a permutation group in polynomial time (Q724293) (← links)
- Recognizing circulant graphs of prime order in polynomial time (Q1386147) (← links)
- Layout of random circulant graphs (Q1794318) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- Minimum chromaticity of circulant graphs (Q2568490) (← links)
- Recognizing recursive circulant graphs (extended abstract) (Q2816083) (← links)
- Finding the automorphism group of a circulant association scheme in polynomial time (Q3022123) (← links)
- Circulant graphs: efficient recognizing and isomorphism testing (Q3439301) (← links)
- Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535) (← links)