1997 | ReviewPaper | Buchkapitel
Graphs drawn with few crossings per edge
verfasst von : János Pach, Géza Tóth
Erschienen in: Graph Drawing
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We show that if a graph of v vertices can be drawn in the plane so that every edge crosses at most k> 0 others, then its number of edges cannot exceed 4.108√kv. For k≤ 4, we establish a better bound, (k + 3)(u− 2), which is tight for k=1 and 2. We apply these estimates to improve a result of Ajtai et al. and Leighton, providing a general lower bound for the crossing number of a graph in terms of its number of vertices and edges.