Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs (Q897592): Difference between revisions

@@ Property / cites work @@
+The Complexity of Colouring by Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Partition into cliques for cubic graphs: Planar case, complexity and approximation
+Normal rank
@@ Property / cites work @@
+The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
+Normal rank
@@ Property / cites work @@
+SOFSEM 2006: Theory and Practice of Computer Science
+Normal rank
@@ Property / cites work @@
+New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes
+Normal rank
@@ Property / cites work @@
+Homomorphisms and oriented colorings of equivalence classes of oriented graphs
+Normal rank
@@ Property / cites work @@
+Good and semi-strong colorings of oriented planar graphs
+Normal rank
@@ Property / cites work @@
+Complexity of two coloring problems in cubic planar bipartite mixed graphs
+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 / cites work @@
+The chromatic number of oriented graphs
@@ Property / cites work: The chromatic number of oriented graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Oriented graph coloring
@@ Property / cites work: Oriented graph coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank