A note on coloring sparse random graphs (Q1025963): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2008.09.038
@@ Property / DOI: 10.1016/j.disc.2008.09.038 / 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/j.disc.2008.09.038
+Normal rank
@@ Property / OpenAlex ID @@
+W2145374630
@@ Property / OpenAlex ID: W2145374630 / rank @@
+Normal rank
@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
+Normal rank
@@ Property / cites work @@
+Exact and approximative algorithms for coloring G(n,p)
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Zero knowledge and the chromatic number
@@ Property / cites work: Zero knowledge and the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Random Graphs
@@ Property / cites work: Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4144785
@@ Property / cites work: Q4144785 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the complexity of the chromatic number problem
+Normal rank
@@ Property / cites work @@
+Sudden emergence of a giant \(k\)-core in a random graph
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2008.09.038
@@ Property / DOI: 10.1016/J.DISC.2008.09.038 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1025963