Pages that link to "Item:Q3644730"
From MaRDI portal
The following pages link to The Crossing Number of Graphs: Theory and Computation (Q3644730):
Displaying 23 items.
- The crossing number of chordal ring networks (Q313472) (← links)
- On crossing numbers of geometric proximity graphs (Q632725) (← links)
- On the crossing number of complete graphs (Q817025) (← links)
- Crossings, colorings, and cliques (Q1028822) (← links)
- Special numbers of crossings for complete graphs (Q1349080) (← links)
- The crossing number of a graph on a compact 2-manifold (Q1352278) (← links)
- The number of crossings in multigraphs with no empty lens (Q1725755) (← links)
- The graph crossing number and its variants: a survey (Q1953539) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- A crossing lemma for multigraphs (Q2189737) (← links)
- Counting the number of crossings in geometric graphs (Q2224846) (← links)
- On the average crosscap number. II: Bounds for a graph (Q2372524) (← links)
- Graph minors and the crossing number of graphs (Q3439581) (← links)
- On the crossing number of some complete multipartite graphs (Q3561431) (← links)
- (Q4552009) (← links)
- (Q4677904) (← links)
- Crossing numbers of random graphs (Q4798172) (← links)
- (Q5136229) (← links)
- Improving the crossing lemma by finding more crossings in sparse graphs (Q5361656) (← links)
- Crossing Numbers and Parameterized Complexity (Q5452207) (← links)
- (Q5688095) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711561) (← links)