Complexity of two coloring problems in cubic planar bipartite mixed graphs (Q968180): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2009.10.016
@@ Property / DOI: 10.1016/j.dam.2009.10.016 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2093519478
@@ Property / OpenAlex ID: W2093519478 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5615282
@@ Property / cites work: Q5615282 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard coloring problems in low degree planar bipartite graphs
+Normal rank
@@ Property / cites work @@
+A note on mixed tree coloring
@@ Property / cites work: A note on mixed tree coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Mixed graph colorings
@@ Property / cites work: Mixed graph colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Scheduling groups of tasks with precedence constraints on three dedicated processors.
+Normal rank
@@ Property / cites work @@
+Coloring some classes of mixed graphs
@@ Property / cites work: Coloring some classes of mixed graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On two coloring problems in mixed graphs
@@ Property / cites work: On two coloring problems in mixed graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2009.10.016
@@ Property / DOI: 10.1016/J.DAM.2009.10.016 / rank @@
+Normal rank