Embedding a Graph in a Plane With Certain Constraints

IEEE Transactions on Circuit Theory

Volumn 17, Issue 2, 1970, Pages 250-252

  Engl, W L ^a   Mlynski, D A ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS; ELECTRIC CIRCUITS, ANALYSIS; GRAPH THEORY; IC; INTEGRATED CIRCUITS; MATHEMATICS;

EID: 0014779876     PISSN: 00189324     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCT.1970.1083103     Document Type: Letter

References (6)

1. L. Auslander and S. V. Parter, “On embedding graphs in the sphere,” J. Math. Mech., vol. 10, pp. 517–523, 1961.
2. A. J. Goldstein, “An efficient and constructive algorithm for testing whether a graph can be embedded in the plane,” (private communication).
3. W. Bader, “Das topologische Problem der gedruckten Schaltung und seine L6sung,” Arch. für Elektrotech., vol. 49, pp. 2–12, 1964.
4. G. J. Fisher and O. Wing, “Computer recognition and extraction of planar graphs from the incidence matrix,” IEEE Trans. Circuit Theory, vol. CT-13, pp. 154–163, June 1966.
5. G. Hotz, “Einbettung von Streckenkomplexen in die Ebene,” Math. Annalen vol. 167, pp. 214–223, 1966.
6. L. Weinberg, “Two new characterizations of planar graphs,” Proc. 5th Allerton Conf. on Circuit and System Theory, (University of Illinois, Urbana, October 1967).