Pages that link to "Item:Q2895410"
From MaRDI portal
The following pages link to Isomorphism testing for circulant graphs \(C_n (a, b)\) (Q2895410):
Displaying 9 items.
- Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs (Q1041408) (← links)
- Ádám's conjecture is true in the square-free case (Q1899064) (← links)
- Testing isomorphism of circulant objects in polynomial time (Q2010626) (← links)
- Vertex-colouring of 3-chromatic circulant graphs (Q2012064) (← links)
- Isomorphism between circulants and Cartesian products of cycles (Q2357772) (← links)
- Testing set proportionality and the Ádám isomorphism of circulant graphs (Q2458932) (← links)
- New families of circulant graphs without Cayley isomorphism property with \(r_i = 2\) (Q2657575) (← links)
- On Super Edge-Antimagic Total Labeling of Toeplitz Graphs (Q3462317) (← links)
- Uniform edge betweenness centrality (Q4957994) (← links)