Complexity of Grundy coloring and its variants (Q1752449): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Complexity of Grundy Coloring and Its Variants
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6501910
@@ Property / title @@
+Complexity of Grundy Coloring and Its Variants (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05060
@@ Property / zbMATH Open document ID: 1465.05060 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-21398-9_9
@@ Property / DOI: 10.1007/978-3-319-21398-9_9 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+October 2015Timestamp +2015-10-29T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-10-29T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 29 October 2015 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6501910
@@ Property / zbMATH DE Number: 6501910 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2964224892
@@ Property / OpenAlex ID: W2964224892 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5336
@@ Property / arXiv ID: 1407.5336 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+On the Grundy number of graphs with few \(P_4\)'s
@@ Property / cites work: On the Grundy number of graphs with few \(P_4\)'s / rank @@
+Normal rank
@@ Property / cites work @@
+Connected Greedy Colourings
@@ Property / cites work: Connected Greedy Colourings / rank @@
+Normal rank
@@ Property / cites work @@
+Fourier meets M\"{o}bius: fast subset convolution
@@ Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Grundy coloring and its variants
@@ Property / cites work: Complexity of Grundy coloring and its variants / rank @@
+Normal rank
@@ Property / cites work @@
+First-fit chromatic numbers of \(d\)-degenerate graphs
+Normal rank
@@ Property / cites work @@
+Some perfect coloring properties of graphs
@@ Property / cites work: Some perfect coloring properties of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability, Definability, and Model-Checking
+Normal rank
@@ Property / cites work @@
+On-line and first fit colorings of graphs
@@ Property / cites work: On-line and first fit colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Grundy and \(b\)-chromatic numbers of a graph
+Normal rank
@@ Property / cites work @@
+Q4745272
@@ Property / cites work: Q4745272 / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+First-fit coloring of bounded tolerance graphs
@@ Property / cites work: First-fit coloring of bounded tolerance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5387684
@@ Property / cites work: Q5387684 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365080
@@ Property / cites work: Q5365080 / rank @@
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on first-fit coloring of interval graphs
@@ Property / cites work: A note on first-fit coloring of interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Q4659607
@@ Property / cites work: Q4659607 / 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 / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4601874
@@ Property / cites work: Q4601874 / rank @@
+Normal rank
@@ Property / cites work @@
+Known Algorithms for Edge Clique Cover are Probably Optimal
+Normal rank
@@ Property / cites work @@
+Q5501346
@@ Property / cites work: Q5501346 / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+On the equality of the grundy and ochromatic numbers of a graph
+Normal rank
@@ Property / cites work @@
+Combinatorial bounds via measure and conquer
@@ Property / cites work: Combinatorial bounds via measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+On-line 3-chromatic graphs. II: Critical graphs
@@ Property / cites work: On-line 3-chromatic graphs. II: Critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding the Running Time of Algorithms for Scheduling and Packing Problems
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the chromatic number problem
+Normal rank
@@ Property / cites work @@
+Homomorphieeigenschaften und mittlere Kantendichte von Graphen
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank