Disk embeddings of planar graphs

DOI10.1007/S00453-003-1055-0zbMATH Open1053.05031OpenAlexW2051231876MaRDI QIDQ1879252FDOQ1879252

Authors: Zhi-Zhong Chen, Xin He 

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1055-0

Recommendations

• A linear algorithm for embedding planar graphs using PQ-trees
• Embedding planar graphs at fixed vertex locations
• scientific article; zbMATH DE number 475595
• scientific article; zbMATH DE number 1305401
• scientific article; zbMATH DE number 508832

zbMATH Keywords

graph algorithmplanar graphplanar embedding

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited In (7)

• On selecting leaves with disjoint neighborhoods in embedded trees
• Linear-time algorithms for problems on planar graphs with fixed disk dimension
• Representing graphs by disks and balls (a survey of recognition-complexity results)
• Disk/band surfaces of spatial graphs
• Title not available (Why is that?)
• Obedient plane drawings for disk intersection graphs
• A new characterization of disk graphs and its application.

This page was built for publication: Disk embeddings of planar graphs

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