Recognizing and drawing IC-planar graphs

DOI10.1016/J.TCS.2016.04.026MaRDI QIDQ6826253zbMATH OpenFDO

Authors Franz J. Brandenburg, Walter Didimo, W. Evans, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani

Publication date 1 June 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2016.04.026

zbMATH Keywords

1-planaritygraph drawingIC-planarityNP-hardnessright angle crossings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(2)

• Extending partial 1-planar drawings
• On proper conflict-free colorings of IC-planar graphs

This page was built for publication: Recognizing and drawing IC-planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826253)