On the Grundy and $b$-chromatic numbers of a graph (Q1949739): Difference between revisions

@@ Property / DOI @@
-.1007/s00453-011-9604-4
@@ Property / DOI: 10.1007/s00453-011-9604-4 / rank @@
-Normal rank
@@ Property / author @@
+Frédéric Havet
@@ Property / author: Frédéric Havet / rank @@
+Normal rank
@@ Property / author @@
+Leonardo Sampaio
@@ Property / author: Leonardo Sampaio / 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.1007/s00453-011-9604-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2127573381
@@ Property / OpenAlex ID: W2127573381 / 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 @@
+\(b\)-coloring of tight graphs
@@ Property / cites work: \(b\)-coloring of tight graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+The b-chromatic number of a graph
@@ Property / cites work: The b-chromatic number of a graph / rank @@
+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
@@ Property / DOI @@
+.1007/S00453-011-9604-4
@@ Property / DOI: 10.1007/S00453-011-9604-4 / rank @@
+Normal rank

On the Grundy and \(b\)-chromatic numbers of a graph (Q1949739): Difference between revisions

Latest revision as of 15:09, 16 December 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)