A Census of Plane Graphs with Polyline Edges
DOI10.1137/15M1046484zbMath1365.05061OpenAlexW2625727308MaRDI QIDQ5267999
Publication date: 14 June 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1046484
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Magnetic interpretation of the nodal defect on graphs
- Counting triangulations of planar point sets
- On the succinct representation of graphs
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- On embedding a cycle in a plane graph
- Embedding graphs in surfaces
- Computing minimum length paths of a given homotopy class
- Testing homotopy for paths in the plane
- Optimal system of loops on an orientable surface
- Singular Lagrangian manifolds and semiclassical analysis.
- A better upper bound on the number of triangulations of a planar point set
- Counting triangulations and other crossing-free structures approximately
- On the number of plane geometric graphs
- Computing homotopic shortest paths efficiently
- Planar graphs, via well-orderly maps and trees
- Counting Plane Graphs: Flippability and Its Applications
- Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
- Asymptotic enumeration and limit laws of planar graphs
- Towards an implementation of the 3D visibility skeleton
- Crossing-Free Subgraphs
- Computing homotopic shortest paths in the plane
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Windrose Planarity: Embedding Graphs with Direction-Constrained Edges
- Detecting Weakly Simple Polygons
- Tightening Nonsimple Paths and Cycles on Surfaces
- Counting Plane Graphs: Cross-Graph Charging Schemes
- DRAWING WITH FAT EDGES
- Transforming Curves on Surfaces Redux
- LATIN 2004: Theoretical Informatics
- Embedding planar graphs at fixed vertex locations
This page was built for publication: A Census of Plane Graphs with Polyline Edges
