scientific article; zbMATH DE number 3258070
From MaRDI portal
Publication:5543311
Cited in
(22)- A combinatorial result on points and circles on the plane
- A successful concept for measuring non-planarity of graphs: The crossing number.
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- The bipartite-cylindrical crossing number of the complete bipartite graph
- On the crossing number of 2-page book drawings of K_n with prescribed number of edges in each page
- The 2-page crossing number of \(K_{n}\)
- Shellable drawings and the cylindrical crossing number of \(K_n\)
- On polynomials and crossing numbers of complete graphs
- scientific article; zbMATH DE number 1382392 (Why is no real title available?)
- scientific article; zbMATH DE number 653276 (Why is no real title available?)
- Bishellable drawings of K_n
- A note on the cross-index of a complete graph based on a linear tree
- Closing in on Hill's conjecture
- On Minimizing One Dimension of Some Two-Dimensional Geometric Representations of Plane Graphs
- Bounding the tripartite‐circle crossing number of complete tripartite graphs
- From art and circuit design to geometry and combinatorics
- Complete minors in complements of nonseparating planar graphs
- On book crossing numbers of the complete graph
- Bounding the tripartite-circle crossing number of complete tripartite graphs
- The crossing number of the complement of a circuit
- A min-max theorem for plane bipartite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5543311)
