Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
From MaRDI portal
Recommendations
- Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.
- On the crossing number of some complete multipartite graphs
- On the crossing number of complete graphs
- On the crossing number of complete graphs
- The number of crossings in a regular drawing of the complete bipartite graph
- The bipartite-cylindrical crossing number of the complete bipartite graph
- On crossing numbers of complete tripartite and balanced complete multipartite graphs
- scientific article; zbMATH DE number 4094839
- The outerplanar crossing number of the complete bipartite graph
- The crossing number of the bipartite permutation graph
Cited in
(31)- A notion of cross-perfect bipartite graphs
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Which crossing number is it anyway?
- A contribution to Guy's conjecture
- The outerplanar crossing number of the complete bipartite graph
- Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs
- On the 2-colored crossing number
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- The bipartite-cylindrical crossing number of the complete bipartite graph
- Empty triangles in good drawings of the complete graph
- Book drawings of complete bipartite graphs
- Shellable drawings and the cylindrical crossing number of \(K_n\)
- On crossing numbers of complete tripartite and balanced complete multipartite graphs
- On the crossing number of K_n without computer assistance
- On the crossing number of some complete multipartite graphs
- Remarks on a conjecture of Barát and Tóth
- A note on the cross-index of a complete graph based on a linear tree
- Crossing numbers of random graphs
- Counting the regions in a regular drawing of \(K_{n,n}\)
- Limiting Crossing Numbers for Geodesic Drawings on the Sphere
- Closing in on Hill's conjecture
- The Complexity of Several Realizability Problems for Abstract Topological Graphs
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- Bounding the tripartite‐circle crossing number of complete tripartite graphs
- On the problems of CF-connected graphs
- Simple realizability of complete abstract topological graphs in P
- On the Orchard crossing number of the complete bipartite graphs
- On book crossing numbers of the complete graph
- Bounding the tripartite-circle crossing number of complete tripartite graphs
- The tripartite-circle crossing number of graphs with two small partition classes
- On the crossing number of complete graphs
This page was built for publication: Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4340676)