On the net-embeddability of graphs

DOI10.1007/BF02583267zbMATH Open0776.05040OpenAlexW1970645374MaRDI QIDQ5288744FDOQ5288744

Authors: Yanpei Liu 

Publication date: 17 August 1993

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

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

Recommendations

• General theoretical results on rectilinear embeddability of graphs
• Theoretical results on at most 1-bend embeddability of graphs
• scientific article; zbMATH DE number 432759
• scientific article; zbMATH DE number 3924797

zbMATH Keywords

embeddabilityplanar graphsforbidden configurations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Embedding of elementary net into gap of nets
• On embedding of a hypercube in a completely overlapping network
• The embedding of rings and meshes into \(\text{RP} (k)\) networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• On embeddability and stresses of graphs
• Proceedings of the conference ``Embedded graphs
• Orthogonal drawings of graphs for the automation of VLSI circuit design
• Title not available (Why is that?)

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

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