On the size of planarly connected crossing graphs

Eyal Ackerman; Balázs Keszegh; Mate Vizer

doi:10.7155/jgaa.00453

On the size of planarly connected crossing graphs

Eyal Ackerman, Balázs Keszegh, Mate Vizer

Faculty of Natural Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

We prove that if an n-vertex graph G can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then G has O(n) edges. Graphs that admit such drawings are related to quasi-planar graphs and to maximal 1-planar and fan-planar graphs.

Original language	English
Pages (from-to)	11-22
Number of pages	12
Journal	Journal of Graph Algorithms and Applications
Volume	22
Issue number	1
DOIs	https://doi.org/10.7155/jgaa.00453
State	Published - 1 Jan 2018

Bibliographical note

Publisher Copyright:
© 2018, Brown University. All rights reserved.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science
Computer Science Applications
Geometry and Topology
Computational Theory and Mathematics

Access to Document

10.7155/jgaa.00453

Cite this

@article{c3e16d08d06b417b911206d86d6de519,

title = "On the size of planarly connected crossing graphs",

abstract = "We prove that if an n-vertex graph G can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then G has O(n) edges. Graphs that admit such drawings are related to quasi-planar graphs and to maximal 1-planar and fan-planar graphs.",

author = "Eyal Ackerman and Bal{\'a}zs Keszegh and Mate Vizer",

year = "2018",

month = jan,

day = "1",

doi = "10.7155/jgaa.00453",

language = "English",

volume = "22",

pages = "11--22",

journal = "Journal of Graph Algorithms and Applications",

issn = "1526-1719",

publisher = "Brown University",

number = "1",

}

TY - JOUR

T1 - On the size of planarly connected crossing graphs

AU - Ackerman, Eyal

AU - Keszegh, Balázs

AU - Vizer, Mate

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We prove that if an n-vertex graph G can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then G has O(n) edges. Graphs that admit such drawings are related to quasi-planar graphs and to maximal 1-planar and fan-planar graphs.

AB - We prove that if an n-vertex graph G can be drawn in the plane such that each pair of crossing edges is independent and there is a crossing-free edge that connects their endpoints, then G has O(n) edges. Graphs that admit such drawings are related to quasi-planar graphs and to maximal 1-planar and fan-planar graphs.

UR - http://www.scopus.com/inward/record.url?scp=85044174826&partnerID=8YFLogxK

U2 - 10.7155/jgaa.00453

DO - 10.7155/jgaa.00453

M3 - Article

AN - SCOPUS:85044174826

SN - 1526-1719

VL - 22

SP - 11

EP - 22

JO - Journal of Graph Algorithms and Applications

JF - Journal of Graph Algorithms and Applications

IS - 1

ER -

On the size of planarly connected crossing graphs

Abstract

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this