Inapproximability of the lid-chromatic number (Q324747): 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.1016/j.endm.2015.07.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2210463884
@@ Property / OpenAlex ID: W2210463884 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing edge colorings of graphs
@@ Property / cites work: Vertex-distinguishing edge colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-distinguishing proper edge-colorings
@@ Property / cites work: Vertex-distinguishing proper edge-colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886768
@@ Property / cites work: Q4886768 / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3676177
@@ Property / cites work: Q3676177 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Locally identifying coloring of graphs
@@ Property / cites work: Locally identifying coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Locally identifying colourings for graphs with given maximum degree
+Normal rank
@@ Property / cites work @@
+Locally identifying coloring in bounded expansion classes of graphs
+Normal rank
@@ Property / cites work @@
+A tree representation for \(P_ 4\)-sparse graphs
@@ Property / cites work: A tree representation for \(P_ 4\)-sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Linear degree extractors and the inapproximability of max clique and chromatic number
+Normal rank