A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\)

DOI10.1016/0095-8956(72)90042-1zbMath0237.05104OpenAlexW2005196216MaRDI QIDQ2552508

Paul C. Kainen

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90042-1

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

A survey of the theory of hypercube graphs, The genus 2 crossing number of \(K_ 9\), The crossing number of locally twisted cubes \(L T Q_n\), Drawings of graphs on surfaces with few crossings, On the skewness of products of graphs, Improved bounds for the crossing numbers on surfaces of genus g, The crossing function of a graph, On crossing numbers of hypercubes and cube connected cycles, On the Stable Crossing Number of Cubes, Chromatic number and skewness, A minimum-vertex triangulation, Some results in topological graph theory, Adjacent Crossings Do Matter, An infinite family of octahedral crossing numbers, Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Das Geschlecht des vollständigen paaren Graphen
• Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
• THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS
• The Genus of the n-Cube
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• The toroidal crossing number of the complete graph
• The toroidal crossing number of Km,n