Pages that link to "Item:Q2431395"
From MaRDI portal
The following pages link to The early history of the brick factory problem (Q2431395):
Displaying 17 items.
- The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph (Q1640218) (← links)
- Approximating the bundled crossing number (Q2154117) (← 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)
- Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
- (Q2857359) (← links)
- On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs (Q2978191) (← links)
- On the Crossing Number of Kn without Computer Assistance (Q3188671) (← links)
- Bishellable drawings of $K_n$ (Q4555043) (← links)
- Working with Lowell (Q5012353) (← links)
- Convex drawings of the complete graph: topology meets geometry (Q5089707) (← links)
- A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
- Closing in on Hill's Conjecture (Q5232152) (← links)
- Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
- Reviews (Q5742363) (← links)
- Bounding the tripartite‐circle crossing number of complete tripartite graphs (Q6057580) (← links)
- Approximating the Bundled Crossing Number (Q6075708) (← links)
