Planar emulators conjecture is nearly true for cubic graphs (Q2346578): Difference between revisions

@@ Property / cites work @@
+How not to characterize planar-emulable graphs
@@ Property / cites work: How not to characterize planar-emulable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3110116
@@ Property / cites work: Q3110116 / rank @@
+Normal rank
@@ Property / cites work @@
+Cubic irreducible graphs for the projective plane
@@ Property / cites work: Cubic irreducible graphs for the projective plane / rank @@
+Normal rank
@@ Property / cites work @@
+years of Negami's planar cover conjecture
@@ Property / cites work: 20 years of Negami's planar cover conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+On possible counterexamples to Negami's planar cover conjecture
+Normal rank
@@ Property / cites work @@
+Enumeration of projective-planar embeddings of graphs
+Normal rank
@@ Property / cites work @@
+Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
+Normal rank