Pages that link to "Item:Q1953539"
From MaRDI portal
The following pages link to The graph crossing number and its variants: a survey (Q1953539):
Displaying 50 items.
- A faster fixed parameter algorithm for two-layer crossing minimization (Q284334) (← links)
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218) (← links)
- Shortest path embeddings of graphs on surfaces (Q1688859) (← links)
- Note on \(k\)-planar crossing numbers (Q1699274) (← links)
- The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds (Q2045399) (← links)
- Edge-minimum saturated \(k\)-planar drawings (Q2151425) (← links)
- Approximating the bundled crossing number (Q2154117) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- The slotted online one-sided crossing minimization problem on 2-regular graphs (Q2169959) (← links)
- The outerplanar crossing number of the complete bipartite graph (Q2172421) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- A crossing lemma for multigraphs (Q2189737) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Bundled crossings revisited (Q2206831) (← links)
- On the 2-colored crossing number (Q2206834) (← links)
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\) (Q2256586) (← links)
- The bipartite-cylindrical crossing number of the complete bipartite graph (Q2308490) (← links)
- Weighted Turán problems with applications (Q2319696) (← links)
- Fan-planarity: properties and complexity (Q2346379) (← links)
- On the rectilinear crossing number of complete uniform hypergraphs (Q2362105) (← links)
- The rectilinear local crossing number of \(K_{n}\) (Q2363361) (← links)
- Shellable drawings and the cylindrical crossing number of \(K_n\) (Q2514231) (← links)
- There are no cubic graphs on 26 vertices with crossing number 10 or 11 (Q2657046) (← links)
- Crossings between non-homotopic edges (Q2673492) (← links)
- Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
- The Bundled Crossing Number (Q2961534) (← links)
- Approximating the Rectilinear Crossing Number (Q2961535) (← links)
- On the Pseudolinear Crossing Number (Q2978177) (← links)
- Deciding Parity of Graph Crossing Number (Q4578013) (← links)
- Beyond Outerplanarity (Q4625142) (← links)
- Orthogonal Tree Decompositions of Graphs (Q4634649) (← links)
- Crossings Between Non-homotopic Edges (Q5014129) (← links)
- Simple Topological Drawings of k-Planar Graphs (Q5014132) (← links)
- Plane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$ (Q5014139) (← links)
- On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens (Q5050004) (← links)
- Hanani--Tutte and Hierarchical Partial Planarity (Q5058130) (← links)
- (Q5075776) (← links)
- The Degenerate Crossing Number and Higher-Genus Embeddings (Q5084703) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- Connecting the dots (with minimum crossings) (Q5088932) (← links)
- A crossing lemma for multigraphs (Q5116525) (← links)
- Link crossing number is NP-hard (Q5118878) (← links)
- An Ongoing Project to Improve the Rectilinear and the Pseudolinear Crossing Constants (Q5119386) (← links)
- (Q5136229) (← links)
- A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
- Bundled Crossings Revisited (Q5141645) (← links)
- Complexity of Geometric k-Planarity for Fixed k (Q5144878) (← links)
- On plane subgraphs of complete topological drawings (Q5156010) (← links)
- Structure of Graphs with Locally Restricted Crossings (Q5346557) (← links)
- Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)