Proof of a conjectured lower bound on the chromatic number of a graph (Q745214): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2015.08.007 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2015.08.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1149759637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for the extreme eigenvalues of block-partitioned Hermitian matrices with applications to spectral graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic number and spectral radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2015.08.007 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:54, 10 December 2024

scientific article
Language Label Description Also known as
English
Proof of a conjectured lower bound on the chromatic number of a graph
scientific article

    Statements

    Identifiers