Exploring the complexity boundary between coloring and list-coloring (Q5899384): 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.2006.06.064
+Normal rank
@@ Property / OpenAlex ID @@
+W2008738950
@@ Property / OpenAlex ID: W2008738950 / rank @@
+Normal rank
@@ Property / cites work @@
+Precoloring extension. I: Interval graphs
@@ Property / cites work: Precoloring extension. I: Interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3439672
@@ Property / cites work: Q3439672 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of completing partial Latin squares
+Normal rank
@@ Property / cites work @@
+The ellipsoid method and its consequences in combinatorial optimization
+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 @@
+Q4838466
@@ Property / cites work: Q4838466 / rank @@
+Normal rank
@@ Property / cites work @@
+Precoloring Extension III: Classes of Perfect Graphs
+Normal rank
@@ Property / cites work @@
+Generalized coloring for tree-like graphs
@@ Property / cites work: Generalized coloring for tree-like graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some results concerning the complexity of restricted colorings of graphs
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5899384