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

ISSN： 0179-5376

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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

The existence of even regular factors of regular graphs on the number of cut edges

By Fan Hong Liu Gui Liu Ji Long He

Acta Mathematica Sinica, Vol. 26, Iss. 12, 2010-12 ,pp. : 2305-2312

Springer Publishing Company

Access to resources Recommend Favorite

The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs

Combinatorics, Probability & Computing, Vol. 26, Iss. 4, 2017-07 ,pp. : 525-535

Cambridge University Press

Access to resources Recommend Favorite

Splitting and contractible edges in 4-connected graphs

By Saito A.

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

Elsevier

Access to resources Recommend Favorite

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings

By Kostochka A.V. Woodall D.R.

European Journal of Combinatorics, Vol. 21, Iss. 2, 2000-02 ,pp. : 249-255

Elsevier

Access to resources Recommend Favorite