The following pages link to (Q5661522):
Displaying 19 items.
- Remarks on a conjecture of Barát and Tóth (Q405159) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- An evolutionary formulation of the crossing number problem (Q1040098) (← links)
- The crossing number of \(C_3\times C_n\) (Q1248631) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Gap-planar graphs (Q1786592) (← links)
- The crossing number of the Cartesian product of paths with complete graphs (Q2449179) (← links)
- (Q4083453) (← links)
- Bishellable drawings of $K_n$ (Q4555043) (← links)
- Deciding Parity of Graph Crossing Number (Q4578013) (← links)
- The Crossing Number of the Cone of a Graph (Q4579956) (← links)
- A note on the cross-index of a complete graph based on a linear tree (Q4692245) (← links)
- A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
- Bad drawings of small complete graphs (Q5206933) (← links)
- Recent Advances in Exact Crossing Minimization (Extended Abstract) (Q5300976) (← links)
- Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580) (← links)
- Topological drawings meet classical theorems from convex geometry (Q6074002) (← links)
- Drawings of complete graphs in the projective plane (Q6080857) (← links)
- Maximum rectilinear crossing number of uniform hypergraphs (Q6083186) (← links)
