The following pages link to Crossing Number is NP-Complete (Q3320398):
Displayed 50 items.
- On the 2-colored crossing number (Q2206834) (← links)
- Exact crossing number parameterized by vertex cover (Q2206863) (← links)
- Rotation and crossing numbers for join products (Q2210206) (← links)
- The crossing number of Cartesian product of 5-wheel with any tree (Q2214315) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Weighted Turán problems with applications (Q2319696) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- Two recursive inequalities for crossing numbers of graphs (Q2358375) (← links)
- On the recognition of fan-planar and maximal outer-fan-planar graphs (Q2408919) (← links)
- Inapproximability ratios for crossing number (Q2413159) (← links)
- Set labelling vertices to ensure adjacency coincides with disjointness (Q2413366) (← links)
- Obtaining a planar graph by vertex deletion (Q2429328) (← links)
- The early history of the brick factory problem (Q2431395) (← links)
- The crossing number of the Cartesian product of paths with complete graphs (Q2449179) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- The crossing number of \(C(3k+1;\{1,k\})\) (Q2461203) (← links)
- The crossing number of \(K_{1,4,n}\) (Q2477388) (← links)
- The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) (Q2478173) (← links)
- Odd crossing number and crossing number are not the same (Q2482214) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- On maximum planar induced subgraphs (Q2500525) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- There are no cubic graphs on 26 vertices with crossing number 10 or 11 (Q2657046) (← links)
- A variable depth neighborhood search algorithm for the min-max arc crossing problem (Q2669507) (← links)
- Crossings between non-homotopic edges (Q2673492) (← links)
- (Q2741531) (← links)
- (Q2777504) (← links)
- Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
- The Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of the<i>n</i>-Cube (Q2825477) (← links)
- An upper bound for the crossing number of augmented cubes (Q2868165) (← links)
- Crossing Minimization in Storyline Visualization (Q2961530) (← links)
- On the Pseudolinear Crossing Number (Q2978177) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- Crossing numbers of imbalanced graphs (Q3055901) (← links)
- The Straight-Line RAC Drawing Problem Is NP-Hard (Q3075508) (← links)
- k-Level Crossing Minimization Is NP-Hard for Trees (Q3078383) (← links)
- An effective crossing minimisation heuristic based on star insertion (Q3121515) (← links)
- Monotone Crossing Number (Q3223961) (← links)
- (Q3300700) (← links)
- (Q3391044) (← links)
- On the Minimum Cut of Planarizations (Q3439582) (← links)
- SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS (Q3459356) (← links)
- How to draw a hypergraph (Q3477978) (← links)
- Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
- An improved upper bound on the crossing number of the hypercube (Q3605145) (← links)
- Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
- Bipartite Graph Representation of Multiple Decision Table Classifiers (Q3646117) (← links)
- Menus of kuratowski subgraphs (Q3801576) (← links)