Proof of a conjectured lower bound on the chromatic number of a graph
type: Item
instance of: scholarly article
title: Proof of a conjectured lower bound on the chromatic number of a graph
zbMATH Open document ID: 1322.05054
author: T. Ando
author: Minghua Lin
published in: Linear Algebra and its Applications
publication date: 2015-10-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 15A45
zbMATH DE Number: 6493740
zbMATH Keywords: chromatic number
zbMATH Keywords: lower bound
MaRDI profile type: Publication
full work available at URL: j.laa.2015.08.007
OpenAlex ID: W1149759637
cites work: Q4040931
cites work: Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory
cites work: Chromatic number and spectral radius
cites work: New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix
DOI: 10.1016/J.LAA.2015.08.007
description: scientific article; zbMATH DE number 6493740