✦ LIBER ✦

Enumeration of generalized graphs

✍ Scribed by N.G de Bruijn; D.A Klarner

Publisher: Elsevier Science
Year: 1969
Weight: 546 KB
Volume: 72
Category: Article
ISSN: 1385-7258
DOI: 10.1016/1385-7258(69)90020-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of Hamiltonian cycles in cer

Enumeration of Hamiltonian cycles in certain generalized Petersen graphs

✍ Allen J Schwenk 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 497 KB

Enumeration of packed graphs

✍ Iwao Sato 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Asymptotic enumeration of full graphs

✍ D. J. Kleitman; F. R. Lasaga; L. J. Cowen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 539 KB

## Abstract A __full graph__ on __n__ vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of __n__ sets. It has an undirected edge between vertices representing intersecting sets, and a directed edge from __a__ to __b__ if the correspo

Enumeration of connected invariant graph

Enumeration of connected invariant graphs

✍ Edward A Bender; E.Rodney Canfield 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Enumeration of connected graph coverings

✍ Kwak, Jin Ho; Lee, Jaeun 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

The number of the isomorphism classes of n-fold coverings of a graph G is enumerated by the authors (Canad.

Enumeration of graphs by degree sequence

✍ Phil Hanlon 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB