Bipartite and series-parallel graphs without planar Lombardi drawings

DOI10.7155/JGAA.00571MaRDI QIDQ5084693zbMATH OpenOpenAlexFDO

Authors David Eppstein

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1906.04401

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Abstract: We find a family of planar bipartite graphs all of whose Lombardi drawings (drawings with circular arcs for edges, meeting at equal angles at the vertices) are nonplanar. We also find families of embedded series-parallel graphs and apex-trees (graphs formed by adding one vertex to a tree) for which there is no planar Lombardi drawing consistent with the given embedding.

Recommendations

• Lombardi Drawings of Graphs
• Lombardi drawings of graphs
• Planar Lombardi Drawings for Subcubic Graphs

Cites work

• A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing
• Conformal mapping of circular quadrilaterals and Weierstrass elliptic functions
• Drawing trees with perfect angular resolution and polynomial area
• Linear-size nonobtuse triangulation of polygons
• Lombardi drawings of graphs
• Lombardi drawings of knots and links
• Topology of series-parallel networks

Cited in

(2)

• Angles of arc-polygons and lombardi drawings of cacti
• Linkless symmetric drawings of series parallel digraphs

This page was built for publication: Bipartite and series-parallel graphs without planar Lombardi drawings

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