ON EIGENVALUES AND COLORINGS OF GRAPHS, II

DOI10.1111/J.1749-6632.1970.TB56474.XzbMATH Open0227.05105OpenAlexW2052535020MaRDI QIDQ5634010FDOQ5634010

Authors: Alan J. Hoffman, Leonard Howes 

Publication date: 1970

Published in: Annals of the New York Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1749-6632.1970.tb56474.x

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (15)

• The smallest eigenvalue of the signless Laplacian
• Chromatic number and the 2-rank of a graph
• Chromatic number and spectral radius
• The spectra of multiplicative attribute graphs
• On the partition associated to the smallest eigenvalues of the \(k\)-point fixing graph
• Graph theory
• Upper bounds on the size of transitive subtournaments in digraphs
• A characterization of weight-regular partitions of graphs
• The chromatic number of random Cayley graphs
• Beyond graph energy: norms of graphs and matrices
• Spectral lower bounds for the quantum chromatic number of a graph
• Distance Laplacian eigenvalues and chromatic number in graphs
• Eigenvalues and partitionings of the edges of a graph
• The trace norm of \(r\)-partite graphs and matrices
• Spectrum and combinatorics of two-dimensional Ramanujan complexes

This page was built for publication: ON EIGENVALUES AND COLORINGS OF GRAPHS, II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5634010)