Pages that link to "Item:Q4285587"

The following pages link to Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture (Q4285587):

Displaying 47 items.

• Remarks on a conjecture of Barát and Tóth (Q405159) (← links)
• The optimal drawings of \(K_{5,n}\) (Q463036) (← links)
• On the crossing number of \(K_{13}\) (Q490997) (← links)
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475) (← links)
• On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\) (Q944744) (← links)
• Finding coherent cyclic orders in strong digraphs (Q949783) (← links)
• The crossing number of \(K_{1,m,n}\) (Q998333) (← links)
• The crossing number of \(K_{2,m}\square P_n\) (Q998409) (← links)
• A successful concept for measuring non-planarity of graphs: The crossing number. (Q1422437) (← links)
• Zarankiewicz's conjecture is finite for each fixed \(m\) (Q1945996) (← links)
• Determining crossing number of join of the discrete graph with two symmetric graphs of order five (Q2003745) (← links)
• \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs (Q2042612) (← links)
• Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\) (Q2053730) (← links)
• The crossing numbers of join of special disconnected graph on five vertices with discrete graphs (Q2115148) (← links)
• Cyclic permutations in determining crossing numbers (Q2158197) (← links)
• The crossing number of \(K_{5,n+1} \setminus e\) (Q2177670) (← links)
• Exploiting symmetry in copositive programs via semidefinite hierarchies (Q2349140) (← links)
• Sketchy tweets: ten minute conjectures in graph theory (Q2429454) (← links)
• The early history of the brick factory problem (Q2431395) (← links)
• Book drawings of complete bipartite graphs (Q2440102) (← links)
• The crossing number of the Cartesian product of paths with complete graphs (Q2449179) (← links)
• The crossing number of \(K_{1,4,n}\) (Q2477388) (← links)
• On the crossing numbers of loop networks and generalized Petersen graphs (Q2575797) (← links)
• Invariant Semidefinite Programs (Q2802527) (← links)
• Asymptotically settling Zarankiewicz's conjecture in finite time, for each \(m\) (Q2857359) (← links)
• On the Crossing Number of Kn without Computer Assistance (Q3188671) (← links)
• (Q3391044) (← links)
• DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS (Q4559259) (← links)
• On the crossing number for Kronecker product of a tripartite graph with path (Q4956189) (← links)
• On the crossing number of join product of the discrete graph with special graphs of order five (Q4957998) (← links)
• ON PROBLEMS OF -CONNECTED GRAPHS FOR (Q4959262) (← links)
• On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} (Q5004063) (← links)
• On Numerical Invariant of Graph (Q5029640) (← links)
• The crossing numbers of join products of paths with three graphs of order five (Q5089904) (← links)
• ON THE CROSSING NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH (Q5110134) (← links)
• A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) (← links)
• Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph (Q5866213) (← links)
• Zip product of graphs and crossing numbers (Q6055394) (← links)
• (Q6124762) (← links)
• The crossing numbers of join products of four graphs of order five with paths and cycles (Q6137692) (← links)
• (Q6150944) (← links)
• The crossing number of Cartesian product of sunlet graph with path and complete bipartite graph (Q6542925) (← links)
• New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming (Q6608048) (← links)
• The crossing number of nearly complete bipartite graphs (Q6624122) (← links)
• The influence of separating cycles in drawings of \(K_5 \setminus e\) in the join product with paths and cycles (Q6634060) (← links)
• The tripartite-circle crossing number of graphs with two small partition classes (Q6640040) (← links)