Pages that link to "Item:Q548653"
From MaRDI portal
The following pages link to Crossing numbers of graphs with rotation systems (Q548653):
Displaying 13 items.
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218) (← links)
- Order on order types (Q1650795) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- Parameterized analysis and crossing minimization problems (Q2172859) (← links)
- Simple realizability of complete abstract topological graphs simplified (Q2189738) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- Rotation numbers for unions of circuits (Q3331257) (← links)
- (Q3424898) (← links)
- Deciding Parity of Graph Crossing Number (Q4578013) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311149) (← links)
- Adjacent Crossings Do Matter (Q5895517) (← links)