ON EIGENVALUES AND COLORINGS OF GRAPHS, II

DOI10.1111/J.1749-6632.1970.TB56474.XMaRDI QIDQ5634010zbMATH OpenOpenAlexFDO

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)

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

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)