The following pages link to (Q5543311):
Displaying 17 items.
- The crossing number of the complement of a circuit (Q759155) (← links)
- A combinatorial result on points and circles on the plane (Q1102972) (← links)
- A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← 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)
- On the crossing number of 2-page book drawings of \(K_n\) with prescribed number of edges in each page (Q2308500) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- Shellable drawings and the cylindrical crossing number of \(K_n\) (Q2514231) (← links)
- On polynomials and crossing numbers of complete graphs (Q2545096) (← links)
- Bishellable drawings of $K_n$ (Q4555043) (← links)
- A note on the cross-index of a complete graph based on a linear tree (Q4692245) (← links)
- Closing in on Hill's Conjecture (Q5232152) (← links)
- Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580) (← links)
- From art and circuit design to geometry and combinatorics (Q6064580) (← links)
- On book crossing numbers of the complete graph (Q6552472) (← links)
- Bounding the tripartite-circle crossing number of complete tripartite graphs (Q6621173) (← links)
