Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580): Difference between revisions

@@ Property / OpenAlex ID @@
+W3209541809
@@ Property / OpenAlex ID: W3209541809 / rank @@
+Normal rank
@@ Property / cites work @@
+Bishellable drawings of $K_n$
@@ Property / cites work: Bishellable drawings of $K_n$ / rank @@
+Normal rank
@@ Property / cites work @@
+The 2-page crossing number of \(K_{n}\)
@@ Property / cites work: The 2-page crossing number of \(K_{n}\) / rank @@
+Normal rank
@@ Property / cites work @@
+Shellable drawings and the cylindrical crossing number of \(K_n\)
+Normal rank
@@ Property / cites work @@
+The bipartite-cylindrical crossing number of the complete bipartite graph
+Normal rank
@@ Property / cites work @@
+The crossing number ofK1,3,n andK2,3,n
@@ Property / cites work: The crossing number ofK1,3,n andK2,3,n / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
+Normal rank
@@ Property / cites work @@
+The early history of the brick factory problem
@@ Property / cites work: The early history of the brick factory problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5543311
@@ Property / cites work: Q5543311 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q5252027
@@ Property / cites work: Q5252027 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5661522
@@ Property / cites work: Q5661522 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Number of Crossings in a Complete Graph
@@ Property / cites work: On the Number of Crossings in a Complete Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing number is hard for cubic graphs
@@ Property / cites work: Crossing number is hard for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The crossing number of <i>K</i><sub>11</sub> is 100
+Normal rank
@@ Property / cites work @@
+Odd crossing number and crossing number are not the same
+Normal rank
@@ Property / cites work @@
+Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+On a problem of P. Turan concerning graphs
@@ Property / cites work: On a problem of P. Turan concerning graphs / rank @@
+Normal rank