5-chromatic strongly regular graphs

DOI10.1016/J.DISC.2004.03.023zbMATH Open1105.05074OpenAlexW2108397634WikidataQ56001815 ScholiaQ56001815MaRDI QIDQ856856FDOQ856856

Authors: Nick C. Fiala, Willem H. Haemers 

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://research.tilburguniversity.edu/en/publications/16d4bde1-141a-428d-9633-b3aba28e7ebb

Recommendations

• The chromatic index of strongly regular graphs
• The strongly regular (45,\,12,\,3,\,3) graphs
• On strongly regular graphs of order \(5(2p+1)\) where \(2p+1\) is a prime number
• On the chromatic number of a random 5-regular graph
• Regular graphs with prescribed chromatic number

zbMATH Keywords

chromatic number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Association schemes, strongly regular graphs (05E30) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Chromatic number and the 2-rank of a graph
• Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
• Interlacing eigenvalues and graphs
• A simple group of order 44,352,000
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Gewirtz graph: An exercise in the theory of graph spectra
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• On Moore Graphs with Diameters 2 and 3
• Title not available (Why is that?)
• Title not available (Why is that?)
• The search for pseudo orthogonal Latin squares of order six
• On the Polynomial of a Graph
• Title not available (Why is that?)
• Spreads in strongly regular graphs
• The strongly regular (40, 12, 2, 4) graphs
• Classification of regular two-graphs on 36 and 38 vertices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Three-class association schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• The uniqueness of the strongly regular graph on 77 points
• The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The strongly regular (45,\,12,\,3,\,3) graphs
• A (49,16,3,6) strongly regular graph does not exist
• Title not available (Why is that?)
• On groups with several doubly-transitive permutation representations
• Title not available (Why is that?)
• Strongly Regular Graphs Derived from Combinatorial Designs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A root graph that is locally the line graph of the Petersen graph
• Title not available (Why is that?)
• Graphs with Maximal Even Girth

Cited In (6)

• The extendability of matchings in strongly regular graphs
• Title not available (Why is that?)
• 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

Uses Software

• GAP
• GRAPE

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)