Bipartite polyhedral maps on closed surfaces are distinguishing 3-colorable with few exceptions (Q1696528): Difference between revisions

@@ Property / cites work @@
+The distinguishing chromatic number
@@ Property / cites work: The distinguishing chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+-Connected planar graphs are 5-distinguishing colorable with two exceptions
+Normal rank
@@ Property / cites work @@
+Q2799604
@@ Property / cites work: Q2799604 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniqueness and faithfulness of embedding of toroidal graphs
+Normal rank
@@ Property / cites work @@
+Q4932412
@@ Property / cites work: Q4932412 / rank @@
+Normal rank
@@ Property / cites work @@
+The distinguishing numbers of graphs on closed surfaces
+Normal rank
@@ Property / cites work @@
+Q2995160
@@ Property / cites work: Q2995160 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2906184
@@ Property / cites work: Q2906184 / rank @@
+Normal rank
@@ Property / cites work @@
+Distinguishing maps
@@ Property / cites work: Distinguishing maps / rank @@
+Normal rank
@@ Property / cites work @@
+Distinguishing maps. II: General case
@@ Property / cites work: Distinguishing maps. II: General case / rank @@
+Normal rank