On the complexity of \(H\)-colouring planar graphs (Q1045065): Difference between revisions

@@ Property / author @@
-Gary MacGillivray
@@ Property / author: Gary MacGillivray / rank @@
-Normal rank
@@ Property / author @@
+Gary MacGillivray
@@ Property / author: Gary MacGillivray / 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.05.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2024156610
@@ Property / OpenAlex ID: W2024156610 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic Homomorphisms and Circular Colorings of Digraphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828516
@@ Property / cites work: Q4828516 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic complexity of list colorings
@@ Property / cites work: Algorithmic complexity of list colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank