Fan-planar graphs: combinatorial properties and complexity results

DOI10.1007/978-3-662-45803-7_16MaRDI QIDQ2936925zbMATH OpenOpenAlexFDO

Authors Carla Binucci, Emilio Di Giacomo, Walter Didimo, Fabrizio Montecchiani, Maurizio Patrignani, Ioannis G. Tollis

Publication date 7 January 2015

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL http://link.springer.com/chapter/10.1007/978-3-662-45803-7_16

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Fan-planarity: properties and complexity
• Fan-planar graphs
• The density of fan-planar graphs
• Simplifying Non-Simple Fan-Planar Drawings
• On the recognition of fan-planar and maximal outer-fan-planar graphs

Cited in

(16)

• On fan-crossing and fan-crossing free graphs
• The density of fan-planar graphs
• Simplifying non-simple fan-planar drawings
• On fan-crossing graphs
• Fan-planarity: properties and complexity
• Compatibility fans for graphical nested complexes
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• Testing Full Outer-2-planarity in Linear Time
• On the recognition of fan-planar and maximal outer-fan-planar graphs
• 2-layer fan-planarity: from caterpillar to stegosaurus
• Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
• Fan-planar graphs
• scientific article; zbMATH DE number 5234236 (Why is no real title available?)
• The family of fan-planar graphs
• Min-\(k\)-planar drawings of graphs
• Min-k-planar drawings of graphs

This page was built for publication: Fan-planar graphs: combinatorial properties and complexity results

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