On the Size of Planarly Connected Crossing Graphs

From MaRDI portal
Publication:2961524

DOI10.1007/978-3-319-50106-2_24zbMath1478.68205OpenAlexW2963804516MaRDI QIDQ2961524

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

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://real.mtak.hu/40904/1/1509.02475v3.pdf




Related Items (3)



Cites Work


This page was built for publication: On the Size of Planarly Connected Crossing Graphs