✦ LIBER ✦

An Algorithm for Testing the Planarity of a Graph

✍ Scribed by Dunn, W.; Chan, S.

Book ID: 120254677
Publisher: Institute of Electrical and Electronics Engineers
Year: 1968
Tongue: English
Weight: 340 KB
Volume: 15
Category: Article
ISSN: 0018-9324
DOI: 10.1109/TCT.1968.1082800

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for testing the planarity o

An algorithm for testing the planarity of a hierarchical graph

✍ Toshinobu Kashiwabara; Sumio Masuda 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 1004 KB

An algorithm for drawing planar graphs

✍ Bor Plestenjak 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

An algorithm for colouring perfect plana

An algorithm for colouring perfect planar graphs

✍ Iain A. Stewart 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 685 KB

An algorithm for reliability analysis of

An algorithm for reliability analysis of planar graphs

✍ Daniel Blenstock 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 573 KB

A Linear-Time Algorithm for Testing Oute

A Linear-Time Algorithm for Testing Outer-1-Planarity

✍ Hong, Seok-Hee; Eades, Peter; Katoh, Naoki; Liotta, Giuseppe; Schweitzer, Pascal 📂 Article 📅 2014 🏛 Springer 🌐 English ⚖ 818 KB

A criterion for the planarity of a graph

✍ Jerome R. Breitenbach 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 146 KB 👁 1 views

In a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244-2711 has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion whi