The toroidal crossing number of the complete graph

DOI10.1016/S0021-9800(68)80063-8zbMath0172.48804WikidataQ56432134 ScholiaQ56432134MaRDI QIDQ5558928

Richard K. Guy, T. A. Jenkyns, Jonathan Schaer

Publication date: 1968

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

zbMATH Keywords

topology

Related Items (19)

Algorithms for the fixed linear crossing number problem ⋮ The rectilinear local crossing number of \(K_{n}\) ⋮ The genus 2 crossing number of \(K_ 9\) ⋮ The 2-page crossing number of \(K_{n}\) ⋮ Drawings of graphs on surfaces with few crossings ⋮ On \(k\)-planar crossing numbers ⋮ Structure of Graphs with Locally Restricted Crossings ⋮ From art and circuit design to geometry and combinatorics ⋮ Book embeddings and crossing numbers ⋮ Improved bounds for the crossing numbers on surfaces of genus g ⋮ Unnamed Item ⋮ The crossing function of a graph ⋮ Unnamed Item ⋮ Edge separators for graphs of bounded genus with applications ⋮ A note on the cross-index of a complete graph based on a linear tree ⋮ Covering nearly surface-embedded graphs with a fixed number of balls ⋮ A lower bound for crossing numbers of graphs with application to \(K_n\),\(K_{pq}\)g, and \(Q(d)\) ⋮ Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill ⋮ A contribution to Guy's conjecture

This page was built for publication: The toroidal crossing number of the complete graph