On the net-embeddability of graphs

DOI10.1007/BF02583267zbMath0776.05040OpenAlexW1970645374MaRDI QIDQ5288744

Yanpei Liu

Publication date: 17 August 1993

Published in: Acta Mathematica Sinica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02583267

zbMATH Keywords

planar graphsembeddabilityforbidden configurations

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Orthogonal drawings of graphs for the automation of VLSI circuit design

Cites Work

• Rectilinear planar layouts and bipolar orientations of planar graphs
• Theoretical results on at most 1-bend embeddability of graphs

This page was built for publication: On the net-embeddability of graphs