Pages that link to "Item:Q1124798"
From MaRDI portal
The following pages link to Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798):
Displaying 25 items.
- On CIS circulants (Q394314) (← links)
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Hardness of computing clique number and chromatic number for Cayley graphs (Q518185) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- Computing the \(k\)-resilience of a synchronized multi-robot system (Q721922) (← links)
- On the independence ratio of distance graphs (Q738864) (← links)
- On the chromatic number of circulant graphs (Q1045059) (← links)
- Layout of random circulant graphs (Q1794318) (← links)
- Vertex-colouring of 3-chromatic circulant graphs (Q2012064) (← links)
- The two-stripe symmetric circulant TSP is in P (Q2164712) (← links)
- Circular automata synchronize with high probability (Q2221830) (← links)
- On Motzkin's problem in the circle group (Q2234362) (← links)
- Distance graphs with maximum chromatic number (Q2476275) (← links)
- Minimum chromaticity of circulant graphs (Q2568490) (← links)
- Random cyclic triangle-free graphs of prime order (Q2666424) (← links)
- Cores of Imprimitive Symmetric Graphs of Order a Product of Two Distinct Primes (Q2800595) (← links)
- The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$ (Q2958104) (← links)
- (Q3410615) (← links)
- Block circulant graphs and the graphs of critical pairs of crowns (Q5009946) (← links)
- Dominator and total dominator coloring of circulant graph <i>C<sub>n</sub></i>(1, 2) (Q5059595) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- The Travelling Salesman Problem in symmetric circulant matrices with two stripes (Q5458063) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5900086) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5925222) (← links)
- Chromatic numbers of Cayley graphs of abelian groups: a matrix method (Q6178783) (← links)