A comparison of bounds for the chromatic number of a graph (Q1159685): Difference between revisions

@@ Property / author @@
-Said M. Selim
@@ Property / author: Said M. Selim / rank @@
-Normal rank
@@ Property / author @@
+Said M. Selim
@@ Property / author: Said M. Selim / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0898-1221(81)90085-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2011531932
@@ Property / OpenAlex ID: W2011531932 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank
@@ Property / cites work @@
+The Eigenvalues of a Graph and Its Chromatic Number
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+The preparation of examination time-tables using a small-store computer
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1159685