Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture - MaRDI portal

Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture

From MaRDI portal
Publication:4285587


DOI10.1002/jgt.3190170602zbMath0792.05142OpenAlexW2086778098WikidataQ122917267 ScholiaQ122917267MaRDI QIDQ4285587

Douglas R. Woodall

Publication date: 24 July 1994

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

Full work available at URL: https://doi.org/10.1002/jgt.3190170602



Related Items

On the Crossing Number of Kn without Computer Assistance, Cyclic permutations in determining crossing numbers, DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS, Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation, The crossing number of \(K_{5,n+1} \setminus e\), The crossing numbers of join products of paths with three graphs of order five, Remarks on a conjecture of Barát and Tóth, The crossing numbers of join products of four graphs of order five with paths and cycles, ON THE CROSSING NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH, Sketchy tweets: ten minute conjectures in graph theory, The early history of the brick factory problem, Book drawings of complete bipartite graphs, Unnamed Item, A successful concept for measuring non-planarity of graphs: The crossing number., Unnamed Item, Unnamed Item, The optimal drawings of \(K_{5,n}\), The crossing number of the Cartesian product of paths with complete graphs, On the crossing number of \(K_{13}\), On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\), The crossing number of \(K_{1,4,n}\), Determining crossing number of join of the discrete graph with two symmetric graphs of order five, Unnamed Item, The crossing number of \(K_{1,m,n}\), The crossing number of \(K_{2,m}\square P_n\), On the crossing number for Kronecker product of a tripartite graph with path, Invariant Semidefinite Programs, On the crossing number of join product of the discrete graph with special graphs of order five, ON PROBLEMS OF -CONNECTED GRAPHS FOR, A survey of graphs with known or bounded crossing numbers, Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\), On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n}, Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill, On the crossing numbers of loop networks and generalized Petersen graphs, Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph, Exploiting symmetry in copositive programs via semidefinite hierarchies, The crossing numbers of join of special disconnected graph on five vertices with discrete graphs, On Numerical Invariant of Graph