Crossing Number Problems

From MaRDI portal
Publication:5680151

DOI10.2307/2319261zbMath0264.05109OpenAlexW4240657212MaRDI QIDQ5680151

Richard K. Guy, Paul Erdős

Publication date: 1973

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2319261




Related Items (57)

Empty monochromatic trianglesConstruction of crossing-critical graphsA lower bound for the optimal crossing-free Hamiltonian cycle problemUnnamed ItemThe crossing numbers of join of some graphs with \(n\) isolated verticesOn weighted sums of numbers of convex polygons in point sets\(K_7\)-minors in optimal 1-planar graphsAbstract order type extension and new results on the rectilinear crossing numberThe crossing number of locally twisted cubes \(L T Q_n\)Drawings of graphs on surfaces with few crossingsDrawing disconnected graphs on the Klein bottleThe crossing number of \(K_{5,n+1} \setminus e\)The crossing numbers of products of paths and stars with 4‐vertex graphsMonotone Crossing NumberBisection width of transposition graphsZip product of graphs and crossing numbersDisproof of a conjecture by Erdős and Guy on the crossing number of hypercubesThe maximum number of halving lines and the rectilinear crossing number of forA central approach to bound the number of crossings in a generalized configurationUnnamed ItemShooting stars in simple drawings of \(K_{m,n}\)On \(k\)-gons and \(k\)-holes in point setsThe 3-symmetric pseudolinear crossing number of \(K_{36}\)Book embeddings and crossing numbersImproved bounds for the crossing numbers on surfaces of genus gOn the central levels problemThe crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycleOn \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\)The crossing number of Cartesian product of 5-wheel with any treeA successful concept for measuring non-planarity of graphs: The crossing number.The crossing number of the Cartesian product of paths with complete graphsSome provably hard crossing number problemsOn 5-Gons and 5-HolesBound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxationOn crossing numbers of hypercubes and cube connected cyclesThe crossing number of \(K_{1,4,n}\)Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)Coloring drawings of bipartite graphs: A problem in automated assembly ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4521491 A lower bound for the crossing number ofCm � Cn] ⋮ 3-symmetric and 3-decomposable geometric drawings of \(K_n\)General lower bounds for the minor crossing number of graphsThe crossing number of \(C_3\times C_n\)A survey of graphs with known or bounded crossing numbersApproximating the Maximum Rectilinear Crossing NumberUnnamed ItemThe Same Upper Bound for Both: The 2-page and the Rectilinear Crossing Numbers of then-CubeUnnamed ItemA new lower bound for the bipartite crossing number with applicationsCrossing-critical edges and Kuratowski subgraphs of a graphInfinite families of crossing-critical graphs with a given crossing numberOn the crossing numbers of loop networks and generalized Petersen graphs2-Layer k-Planar GraphsPlane Spanning Trees in Edge-Colored Simple Drawings of $$K_{n}$$Graph minors and the crossing number of graphsAn upper bound for the crossing number of augmented cubesOn the crossing number of complete graphs




This page was built for publication: Crossing Number Problems