5-chromatic strongly regular graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3877205 (Why is no real title available?)
- scientific article; zbMATH DE number 3668627 (Why is no real title available?)
- scientific article; zbMATH DE number 3670480 (Why is no real title available?)
- scientific article; zbMATH DE number 3733933 (Why is no real title available?)
- scientific article; zbMATH DE number 3733985 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- scientific article; zbMATH DE number 107539 (Why is no real title available?)
- scientific article; zbMATH DE number 3478931 (Why is no real title available?)
- scientific article; zbMATH DE number 475371 (Why is no real title available?)
- scientific article; zbMATH DE number 493043 (Why is no real title available?)
- scientific article; zbMATH DE number 3805603 (Why is no real title available?)
- scientific article; zbMATH DE number 3445296 (Why is no real title available?)
- scientific article; zbMATH DE number 874569 (Why is no real title available?)
- scientific article; zbMATH DE number 3432307 (Why is no real title available?)
- scientific article; zbMATH DE number 3204642 (Why is no real title available?)
- scientific article; zbMATH DE number 3349875 (Why is no real title available?)
- scientific article; zbMATH DE number 3377258 (Why is no real title available?)
- A (49,16,3,6) strongly regular graph does not exist
- A root graph that is locally the line graph of the Petersen graph
- A simple group of order 44,352,000
- Chromatic number and the 2-rank of a graph
- Classification of regular two-graphs on 36 and 38 vertices
- Graphs with Maximal Even Girth
- Interlacing eigenvalues and graphs
- On Moore Graphs with Diameters 2 and 3
- On groups with several doubly-transitive permutation representations
- On the Polynomial of a Graph
- Spreads in strongly regular graphs
- Strongly Regular Graphs Derived from Combinatorial Designs
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- The Gewirtz graph: An exercise in the theory of graph spectra
- The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\)
- The search for pseudo orthogonal Latin squares of order six
- The strongly regular (40, 12, 2, 4) graphs
- The strongly regular (45,\,12,\,3,\,3) graphs
- The uniqueness of the strongly regular graph on 77 points
- Three-class association schemes
Cited in
(6)- The extendability of matchings in strongly regular graphs
- scientific article; zbMATH DE number 1910735 (Why is no real title available?)
- On 3-chromatic distance-regular graphs
- Strongly regular tri-Cayley graphs
- Spectral lower bounds for the quantum chromatic number of a graph. II
- Non rank 3 strongly regular graphs with the 5-vertex condition
This page was built for publication: 5-chromatic strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856856)