Coloring minimal Cayley graphs
From MaRDI portal
Recommendations
Cites work
- A Combinatorial Classic — Sparse Graphs with High Chromatic Number
- Bounding the maximal size of independent generating sets of finite groups
- Chromatic numbers of Cayley graphs of abelian groups: a matrix method
- Connectivity of minimal Cayley graphs
- Embedding graphs in Cayley graphs
- Generation of finite simple groups by an involution and an element of prime order
- Graphs of groups on surfaces. Interactions and models
- Graphs with Given Group and Given Graph-Theoretical Properties
- Hamiltonian paths in Cayley graphs
- scientific article; zbMATH DE number 5697243 (Why is no real title available?)
- scientific article; zbMATH DE number 3593595 (Why is no real title available?)
- scientific article; zbMATH DE number 3639660 (Why is no real title available?)
- scientific article; zbMATH DE number 1222447 (Why is no real title available?)
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- Independent generating sets and geometries for symmetric groups
- Maximal subgroups of nontorsion Grigorchuk–Gupta–Sidki groups
- Odd distances in colourings of the plane
- On Burnside's problem on periodic groups
- On isomorphisms of minimal Cayley graphs and digraphs
- On minimal distance-regular Cayley graphs of generalized dihedral groups
- On sensitivity in bipartite Cayley graphs
- On the chromatic number of random Cayley graphs
- Ramanujan graphs
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Situation der Untergruppen und Struktur der Gruppe.
- The chromatic number of random Cayley graphs
- Ueber Gruppen, deren sämtliche Teiler Normalteiler sind.
- What's not inside a Cayley graph
Cited in
(3)
This page was built for publication: Coloring minimal Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6664149)