Planar crossing numbers of graphs of bounded genus (Q452001): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00454-012-9430-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2041021602
@@ Property / OpenAlex ID: W2041021602 / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing-Free Subgraphs
@@ Property / cites work: Crossing-Free Subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE
+Normal rank
@@ Property / cites work @@
+A New Approach to Exact Crossing Minimization
@@ Property / cites work: A New Approach to Exact Crossing Minimization / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the graph crossing number problem
+Normal rank
@@ Property / cites work @@
+Algorithms for the fixed linear crossing number problem
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+Crossing Numbers and Cutwidths
@@ Property / cites work: Crossing Numbers and Cutwidths / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning planar graphs with vertex costs: Algorithms and applications
+Normal rank
@@ Property / cites work @@
+Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
+Normal rank
@@ Property / cites work @@
+Crossing Number is NP-Complete
@@ Property / cites work: Crossing Number is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)
+Normal rank
@@ Property / cites work @@
+Computing crossing numbers in quadratic time
@@ Property / cites work: Computing crossing numbers in quadratic time / 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 @@
+Q3549636
@@ Property / cites work: Q3549636 / rank @@
+Normal rank
@@ Property / cites work @@
+Planarizing Graphs - A Survey and Annotated Bibliography
+Normal rank
@@ Property / cites work @@
+Improving the crossing lemma by finding more crossings in sparse graphs
+Normal rank
@@ Property / cites work @@
+Applications of the crossing number
@@ Property / cites work: Applications of the crossing number / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Drawing
@@ Property / cites work: Graph Drawing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352316
@@ Property / cites work: Q4352316 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge separators for graphs of bounded genus with applications
+Normal rank
@@ Property / cites work @@
+On VLSI layouts of the star graph and related networks
+Normal rank
@@ Property / cites work @@
+Planar Crossing Numbers of Genus g Graphs
@@ Property / cites work: Planar Crossing Numbers of Genus g Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor
+Normal rank
@@ Property / cites work @@
+Q3014503
@@ Property / cites work: Q3014503 / rank @@
+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