On the Grundy Number of a Graph (Q3058701): Difference between revisions

@@ 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.1007/978-3-642-17493-3_17
+Normal rank
@@ Property / OpenAlex ID @@
+W2136052264
@@ Property / OpenAlex ID: W2136052264 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216674
@@ Property / cites work: Q3216674 / rank @@
+Normal rank
@@ Property / cites work @@
+On an upper bound of the graph's chromatic number, depending on the graph's degree and density
+Normal rank
@@ Property / cites work @@
+Uniquely Colourable Graphs and  the Hardness of Colouring Graphs  of Large Girth
+Normal rank
@@ Property / cites work @@
+(\(\Delta-k\))-critical graphs
@@ Property / cites work: (\(\Delta-k\))-critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures for Sparse Symmetric Gaussian Elimination
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Colouring graphs when the number of colours is nearly the maximum degree
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+A strengthening of Brooks' theorem
@@ Property / cites work: A strengthening of Brooks' theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Results on the Grundy chromatic number of graphs
@@ Property / cites work: Results on the Grundy chromatic number of graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3058701