✦ LIBER ✦

An algorithm for colouring perfect planar graphs

✍ Scribed by Iain A. Stewart

Book ID: 113163371
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 685 KB
Volume: 31
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90075-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(N2) algorithm for coloring perfect

An O(N2) algorithm for coloring perfect planar graphs

✍ Alan Tucker; Donna Wilson 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 501 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 coloring some perfect g

An algorithm for coloring some perfect graphs

✍ Hacène Aït Haddadène; Sylvain Gravier; Frédéric Maffray 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 881 KB

Efficient parallel and sequential algori

Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs

✍ Xin He 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 816 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

Efficient algorithms for minimum weighte

Efficient algorithms for minimum weighted colouring of some classes of perfect graphs

✍ Chính T. Hoàng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 783 KB