Pages that link to "Item:Q518185"
From MaRDI portal
The following pages link to Hardness of computing clique number and chromatic number for Cayley graphs (Q518185):
Displaying 6 items.
- Hardness results and spectral techniques for combinatorial problems on circulant graphs (Q1124798) (← links)
- On maximal cliques of Cayley graphs over fields (Q2164975) (← links)
- (Q4228449) (← links)
- Strong cliques in vertex‐transitive graphs (Q6134644) (← links)
- Chromatic numbers of Cayley graphs of abelian groups: a matrix method (Q6178783) (← links)
- The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes (Q6615549) (← links)