A comparison of bounds for the chromatic number of a graph

DOI10.1016/0898-1221(81)90085-7zbMath0475.05033OpenAlexW2011531932MaRDI QIDQ1159685

Jenifer Haselgrove, Said M. Selim

Publication date: 1981

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90085-7

zbMATH Keywords

adjacency matrixchromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• The Eigenvalues of a Graph and Its Chromatic Number
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• An inequality for the chromatic number of a graph
• The preparation of examination time-tables using a small-store computer

This page was built for publication: A comparison of bounds for the chromatic number of a graph