The following pages link to (Q5587734):
Displayed 9 items.
- Non-planar core reduction of graphs (Q1011763) (← links)
- A combinatorial result on points and circles on the plane (Q1102972) (← links)
- Coloring drawings of bipartite graphs: A problem in automated assembly (Q1208463) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Crossing number is hard for cubic graphs (Q2496198) (← links)
- A lower bound for the rectilinear crossing number (Q2573799) (← links)
- Geometria combinatoria e geometrie finite (Q3218706) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)