A new algorithm for embedding plane graphs at fixed vertex locations

DOI10.37236/10106zbMath1490.05186OpenAlexW4200030941MaRDI QIDQ2121749

Marcus Schaefer

Publication date: 4 April 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/10106

zbMATH Keywords

planar graphgraph embeddingfixed-vertex location

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
• Drawing colored graphs on colored points
• Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Örtern der Knotenbilder
• Triangulating planar graphs while minimizing the maximum degree
• A theorem on graphs
• Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations
• Simultaneous Embeddings with Vertices Mapping to Pre-specified Points
• Arboricity and Subgraph Listing Algorithms
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Extending Partial Orthogonal Drawings
• Drawing Partially Embedded and Simultaneously Planar Graphs
• Embedding planar graphs at fixed vertex locations