A lower bound for crossing numbers of graphs with application to K_n,K_pqg, and Q(d)
From MaRDI portal
Publication:2552508
Cites work
- Das Geschlecht des vollständigen paaren Graphen
- scientific article; zbMATH DE number 3179262 (Why is no real title available?)
- scientific article; zbMATH DE number 3390785 (Why is no real title available?)
- scientific article; zbMATH DE number 3060538 (Why is no real title available?)
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- The Genus of the n-Cube
- THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS
- The toroidal crossing number of Km,n
- The toroidal crossing number of the complete graph
- Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
Cited in
(16)- A survey of the theory of hypercube graphs
- The crossing function of a graph
- Chromatic number and skewness
- A minimum-vertex triangulation
- Some results in topological graph theory
- The crossing number of locally twisted cubes \(L T Q_n\)
- The genus 2 crossing number of \(K_ 9\)
- Drawings of graphs on surfaces with few crossings
- An infinite family of octahedral crossing numbers
- Turán's brick factory problem: the status of the conjectures of Zarankiewicz and Hill
- On the Stable Crossing Number of Cubes
- Adjacent Crossings Do Matter
- On the skewness of products of graphs
- Improved bounds for the crossing numbers on surfaces of genus g
- On crossing numbers of hypercubes and cube connected cycles
- On the skewness of the generalized Heawood graphs
This page was built for publication: A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2552508)
