Pages that link to "Item:Q790829"
From MaRDI portal
The following pages link to Lower bounds for the clique and the chromatic numbers of a graph (Q790829):
Displayed 10 items.
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II) (Q686466) (← links)
- Walks and the spectral radius of graphs (Q852649) (← links)
- Spectral radii of graphs with given chromatic number (Q868006) (← links)
- Reverse binary graphs (Q1310229) (← links)
- The maximum clique problem (Q1318271) (← links)
- On completely positive graphs and their complements (Q1406281) (← links)
- Exact bounds on the order of the maximum clique of a graph. (Q1811073) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- Clique, chromatic, and Lovász numbers of certain circulant graphs (Q3439129) (← links)
- The largest eigenvalue of a graph: A survey (Q4713877) (← links)