✦ LIBER ✦

An edge-oriented adjacency list for undirected graphs

✍ Scribed by L. K. Chen; B. S. Ting; A. Sangiovanni-Vincentelli

Publisher: John Wiley and Sons
Year: 1979
Tongue: English
Weight: 416 KB
Volume: 7
Category: Article
ISSN: 0098-9886
DOI: 10.1002/cta.4490070107

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An edge coloring problem for graph produ

An edge coloring problem for graph products

✍ Faudree, R. J.; Gy�rf�s, Andr�as; Schelp, R. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB 👁 1 views

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H

Searching for an edge in a graph

✍ M. Aigner; E. Triesch 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 484 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will