On the size of planarly connected crossing graphs

DOI10.7155/jgaa.00453zbMath1377.05117arXiv1509.02475OpenAlexW2766243613MaRDI QIDQ4600734

Balázs Keszegh, Eyal Ackerman, Máté Vizer

Publication date: 12 January 2018

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.02475

zbMATH Keywords

graph drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

The density of fan-planar graphs ⋮ Crossing Numbers of Beyond-Planar Graphs Revisited ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ On RAC drawings of graphs with one bend per edge ⋮ On RAC drawings of graphs with one bend per edge ⋮ Quantitative Restrictions on Crossing Patterns

This page was built for publication: On the size of planarly connected crossing graphs