scientific article; zbMATH DE number 3344600
From MaRDI portal
zbMath0217.02303MaRDI QIDQ5620616
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Algorithms for the fixed linear crossing number problem, Grids and their minors, NETPAD: An interactive graphics system for network modeling and optimization, Drawings of complete graphs in the projective plane, Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes, Unnamed Item, On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\), Counting links and knots in complete graphs, Drawing complete multipartite graphs on the plane with restrictions on crossings, On the crossing number of \(K_{13}\), Optimal crossing-free Hamiltonian circuit drawings of \(K_n\), Optimal crossing-free Hamiltonian circuit drawings of \(K_n\), An improved upper bound on the crossing number of the hypercube, Graph theory, The crossing number of \(K_{1,m,n}\), Counting links in complete graphs, Closing in on Hill's Conjecture, A contribution to Guy's conjecture
