Counting Plane Graphs: Cross-Graph Charging Schemes

DOI10.1007/978-3-642-36763-2_3MaRDI QIDQ4912187zbMATH OpenOpenAlexFDO

Authors Adam Sheffer, Micha Sharir

Publication date 3 April 2013

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36763-2_3

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Counting plane graphs: cross-graph charging schemes
• Counting planar graphs and related families of graphs
• Counting over non-planar graphs
• Counting and enumerating crossing-free geometric graphs
• Counting and enumerating crossing-free geometric graphs
• On graph crossing number and edge planarization
• Crossing numbers of beyond-planar graphs
• Crossing numbers of beyond-planar graphs

Cited in

(4)

• On numbers of pseudo-triangulations
• Crossings in grid drawings
• A census of plane graphs with polyline edges
• Counting plane graphs: cross-graph charging schemes

This page was built for publication: Counting Plane Graphs: Cross-Graph Charging Schemes

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