The following pages link to Crossing Numbers of Graphs (Q4589364):
Displaying 29 items.
- Crossing numbers and stress of random graphs (Q1725756) (← links)
- On the \(k\)-planar local crossing number (Q1727762) (← links)
- Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
- Taking a detour; or, Gioan's theorem, and pseudolinear drawings of complete graphs (Q2039302) (← links)
- The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds (Q2045399) (← links)
- A note on the crossing number of the cone of a graph (Q2053697) (← links)
- Improvement on the crossing number of crossing-critical graphs (Q2117357) (← links)
- Complete graph drawings up to triangle mutations (Q2136833) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- The outerplanar crossing number of the complete bipartite graph (Q2172421) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- A note on the crossing numbers of 5-regular graphs (Q2194536) (← links)
- There are no cubic graphs on 26 vertices with crossing number 10 or 11 (Q2657046) (← links)
- Crossings between non-homotopic edges (Q2673492) (← links)
- Hanani-Tutte for radial planarity. II (Q2684882) (← links)
- Quantitative Restrictions on Crossing Patterns (Q5001654) (← links)
- Limiting Crossing Numbers for Geodesic Drawings on the Sphere (Q5014128) (← links)
- Crossings Between Non-homotopic Edges (Q5014129) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- Crossing Numbers of Beyond-Planar Graphs Revisited (Q5084712) (← links)
- On Layered Fan-Planar Graph Drawings (Q5089175) (← links)
- A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
- Bad drawings of small complete graphs (Q5206933) (← links)
- Inserting one edge into a simple drawing is hard (Q5925627) (← links)
- Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes (Q6050275) (← links)
- Drawings of complete graphs in the projective plane (Q6080857) (← links)
- Weak-dynamic coloring of graphs beyond-planarity (Q6144496) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
