✦ LIBER ✦

An algebraic method for finding a dual graph of a given graph

✍ Scribed by Vidyasagar, M.

Book ID: 120253939
Publisher: Institute of Electrical and Electronics Engineers
Year: 1970
Tongue: English
Weight: 400 KB
Volume: 17
Category: Article
ISSN: 0018-9324
DOI: 10.1109/TCT.1970.1083140

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for finding the l

An efficient algorithm for finding the largest chain graph according to a given chain graph

✍ Baijun Liu; Zhongguo Zheng; Hui Zhao 📂 Article 📅 2005 🏛 SP Science China Press 🌐 English ⚖ 239 KB

Algorithm to assist in finding the Compl

Algorithm to assist in finding the Complete Sub-graphs of a Given Graph

✍ MEETHAM, A. R. 📂 Article 📅 1966 🏛 Nature Publishing Group 🌐 English ⚖ 123 KB

An algorithm finding p-medians of a grap

An algorithm finding p-medians of a graph

✍ S. A. Gorunovich 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 455 KB

An Algorithm for Finding a Minimal Equiv

An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

✍ Hsu, Harry T. 📂 Article 📅 1975 🏛 Association for Computing Machinery 🌐 English ⚖ 320 KB

An Algorithm for Finding a Minimum Equiv

An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

✍ Moyles, Dennis M.; Thompson, Gerald L. 📂 Article 📅 1969 🏛 Association for Computing Machinery 🌐 English ⚖ 357 KB

On universal graphs for planar oriented

On universal graphs for planar oriented graphs of a given girth

✍ O.V. Borodin; A.V. Kostochka; J. Nešetřil; A. Raspaud; E. Sopena 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 662 KB

The oriented chromatic number o(H) of an oriented graph H is defined to be the minimum order of an oriented graph H' such that H has a homomorphism to H'. If each graph in a class ~ has a homomorphism to the same H', then H' is ~-universal. Let ~k denote the class of orientations of planar graphs wi