Sciweavers

    COMPGEOM
    2006
    ACM
    107views Discrete Geometry» more  COMPGEOM 2006»
    On the maximum number of edges in topological graphs with no four pairwise crossing edges
    15 years 10 months ago
    On the maximum number of edges in topological graphs with no four pairwise crossing edges
    Download  page.mi.fu-berlin.de
    A topological graph is called k-quasi-planar, if it does not contain k pairwise crossing edges. It is conjectured that for every fixed k, the maximum number of edges in a kquasi-...
    Eyal Ackerman
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.