Lower bounds for the clique and the chromatic numbers of a graph
From MaRDI portal
Publication:790829
DOI10.1016/0166-218X(83)90015-XzbMath0535.05029MaRDI QIDQ790829
C. H. Elphick, Christopher S. Edwards
Publication date: 1983
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
Conjectured bounds for the sum of squares of positive eigenvalues of a graph, Walks and the spectral radius of graphs, Spectral radii of graphs with given chromatic number, Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size, A note on eigenvalues of signed graphs, A sharp upper bound on the spectral radius of \(C_5\)-free/\(C_6\)-free graphs with given size, New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix, Two conjectured strengthenings of Turán's theorem, Signed spectral Turań-type theorems, The signless Laplacian spectral radius of graphs with a prescribed number of edges, Remarks on the largest eigenvalue of a signed graph, On completely positive graphs and their complements, Counting substructures and eigenvalues. I: Triangles, Partitions of graphs into small and large sets, A spectral version of Mantel's theorem, Distance Laplacian eigenvalues and chromatic number in graphs, Some eigenvalue properties in graphs (conjectures of Graffiti -- II), Analytic methods for uniform hypergraphs, A survey of automated conjectures in spectral graph theory, Chromatic number and signless Laplacian spectral radius of graphs, Eigenvalues and chromatic number of a signed graph, Measure-theoretic bounds on the spectral radius of graphs from walks, Turán's theorem implies Stanley's bound, Exact bounds on the order of the maximum clique of a graph., The largest eigenvalue of a graph: A survey, Eigenvalues and triangles in graphs, More spectral bounds on the clique and independence numbers, Ordering graphs with given size by their signless Laplacian spectral radii, Computers and discovery in algebraic graph theory, Reverse binary graphs, Clique, chromatic, and Lovász numbers of certain circulant graphs, The \(p\)-spectral radius of \(k\)-partite and \(k\)-chromatic uniform hypergraphs, The maximum clique problem, New analytical lower bounds on the clique number of a graph
Cites Work
- Continuous Timetabling Problems
- The Largest Vertex Degree Sum for a Triangle in a Graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Bounds for the chromatic number of a graph
- A lower bound on the chromatic number of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
