Pages that link to "Item:Q1850498"
From MaRDI portal
The following pages link to Which crossing number is it anyway? (Q1850498):
Displaying 40 items.
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- Removing even crossings (Q885288) (← links)
- Clustered planarity testing revisited (Q895058) (← links)
- Note on the pair-crossing number and the odd-crossing number (Q938304) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- Removing even crossings on surfaces (Q1039443) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- Decidability of string graphs (Q1887714) (← links)
- On the degenerate crossing number (Q1953051) (← links)
- Crossing lemma for the odd-crossing number (Q2088881) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Unified Hanani-Tutte theorem (Q2401398) (← links)
- An upper bound on the sum of powers of the degrees of simple 1-planar graphs (Q2448897) (← links)
- Odd crossing number and crossing number are not the same (Q2482214) (← links)
- Approximating the Maximum Rectilinear Crossing Number (Q2817887) (← links)
- (Q2857373) (← links)
- Towards the Hanani-Tutte Theorem for Clustered Graphs (Q2945188) (← links)
- A Separator Theorem for String Graphs and its Applications (Q3058296) (← links)
- Hanani-Tutte and Monotone Drawings (Q3104784) (← links)
- Monotone Crossing Number (Q3223961) (← links)
- On the Decay of Crossing Numbers of Sparse Graphs (Q3466340) (← links)
- Removing Even Crossings on Surfaces (Q3503455) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
- The Effect of Planarization on Width (Q4625143) (← links)
- Crossing numbers of random graphs (Q4798172) (← links)
- Drawing Shortest Paths in Geodetic Graphs (Q5014127) (← links)
- Drawing Shortest Paths in Geodetic Graphs (Q5050002) (← links)
- (Q5088969) (← links)
- On plane subgraphs of complete topological drawings (Q5156010) (← links)
- Near-Optimal Separators in String Graphs (Q5414151) (← links)
- A Bipartite Strengthening of the Crossing Lemma (Q5452205) (← links)
- Crossing Numbers and Parameterized Complexity (Q5452207) (← links)
- Adjacent Crossings Do Matter (Q5895517) (← links)
- Recognizing string graphs in NP (Q5917583) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
