Good and semi-strong colorings of oriented planar graphs (Q1334637): Difference between revisions

@@ Property / cites work @@
+Every planar graph has an acyclic 7-coloring
@@ Property / cites work: Every planar graph has an acyclic 7-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On acyclic colorings of planar graphs
@@ Property / cites work: On acyclic colorings of planar graphs / rank @@
+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 @@
+Acyclic colorings of planar graphs
@@ Property / cites work: Acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / 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 @@
+Q4200238
@@ Property / cites work: Q4200238 / rank @@
+Normal rank
@@ Property / cites work @@
+Colorings and interpretations: a connection between graphs and grammar forms
+Normal rank
@@ Property / cites work @@
+Every planar graph has an acyclic 8-coloring
@@ Property / cites work: Every planar graph has an acyclic 8-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank