Related content

New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of K_n

By Aichholzer Oswin   Garcia Jesus   Orden David   Ramos Pedro  

Discrete & Computational Geometry, Vol. 38, Iss. 1, 2007-07 ,pp. : 1-14

Springer Publishing Company

Access to resources Recommend Favorite

Crossing-number critical graphs have bounded path-width

By Hlineny P.  

Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. : 347-367

Elsevier

Access to resources Recommend Favorite

Arrangements, circular arrangements and the crossing number of C 7 xC n

By Adamsson J.   Richter R.B.  

Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. : 21-39

Elsevier

Access to resources Recommend Favorite

On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

By Ackerman Eyal  

Discrete & Computational Geometry, Vol. 41, Iss. 3, 2009-04 ,pp. : 365-375

Springer Publishing Company

Access to resources Recommend Favorite

Isolating an Odd Number of Elements and Applications in Complexity Theory

By Gupta S.  

Theory of Computing Systems, Vol. 31, Iss. 1, 1998-02 ,pp. : 27-40

Springer Publishing Company

Access to resources Recommend Favorite