Pages that link to "Item:Q4675535"

The following pages link to Circulant graphs: recognizing and isomorphism testing in polynomial time (Q4675535):

Displaying 33 items.

• Bases of Schurian antisymmetric coherent configurations and an isomorphism test for Schurian tournaments (Q376133) (← links)
• Powers of cycles, powers of paths, and distance graphs (Q531605) (← links)
• On Hamiltonian paths in distance graphs (Q533446) (← links)
• Cubic time recognition of cocircuit graphs of uniform oriented matroids (Q607364) (← links)
• Long cycles and paths in distance graphs (Q712275) (← links)
• Finding a cycle base of a permutation group in polynomial time (Q724293) (← links)
• Two-closures of supersolvable permutation groups in polynomial time (Q777912) (← links)
• Schur rings over a Galois ring of odd characteristic (Q986119) (← links)
• Permutation group approach to association schemes (Q1039422) (← links)
• Schur rings. (Q1039425) (← links)
• Polynomial time recognition and testing of isomorphism of cyclic tournaments (Q1190955) (← links)
• 3-connected reduction for regular graph covers (Q1663806) (← links)
• Separability of Schur rings over abelian \(p\)-groups (Q1792006) (← links)
• On WL-rank and WL-dimension of some Deza circulant graphs (Q2053703) (← links)
• Hamiltonian problems in directed graphs with simple row patterns (Q2143132) (← links)
• Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
• Schur rings over a product of Galois rings (Q2452336) (← links)
• On Cayley representations of central Cayley graphs over almost simple groups (Q2688254) (← links)
• Isomorphism testing for circulant graphs \(C_n (a, b)\) (Q2895410) (← links)
• A survey on undirected circulant graphs (Q2905302) (← links)
• On the separability problem for circulant S-rings (Q3178719) (← links)
• A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
• A family of permutation groups with exponentially many nonconjugated regular elementary abelian subgroups (Q4565031) (← links)
• (Q4601878) (← links)
• (Q5150427) (← links)
• Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)
• The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925529) (← links)
• The Weisfeiler-Leman algorithm and recognition of graph properties (Q5925678) (← links)
• On the WL-dimension of circulant graphs of prime power order (Q6119507) (← links)
• Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)
• Canonization of a random circulant graph by counting walks (Q6575405) (← links)
• Combinatorial refinement on circulant graphs (Q6599766) (← links)
• The Kirchhoff indices for circulant graphs (Q6641635) (← links)