Pages that link to "Item:Q5311149"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311149):
Displaying 10 items.
- Crossing numbers of graphs with rotation systems (Q548653) (← links)
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Hardness of approximation for crossing number (Q1943651) (← links)
- The crossing number of \(K_{1,4,n}\) (Q2477388) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- There are no cubic graphs on 26 vertices with crossing number 10 or 11 (Q2657046) (← links)
- Crossing Number is Hard for Kernelization (Q3132876) (← links)
- (Q4028470) (← links)