✦ LIBER ✦

The enumeration of connected graphs and linked diagrams

✍ Scribed by Albert Nijenhuis; Herbert S Wilf

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 201 KB
Volume: 27
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(79)90023-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 cyclically 4-connected cu

Enumeration of cyclically 4-connected cubic graphs

✍ Nicholas C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 550 KB

On a class of linked diagrams, I. Enumer

On a class of linked diagrams, I. Enumeration

✍ Paul R Stein 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Free Cumulants and Enumeration of Connec

Free Cumulants and Enumeration of Connected Partitions

✍ Franz Lehner 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 193 KB

The Connectivities of Leaf Graphs of 2-C

The Connectivities of Leaf Graphs of 2-Connected Graphs

✍ Atsushi Kaneko; Kiyoshi Yoshimoto 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Given a connected graph G, denote by V the family of all the spanning trees of G. Define an adjacency relation in V as follows: the spanning trees t and t$ are said to be adjacent if for some vertex u # V, t&u is connected and coincides with t$&u. The resultant graph G is called the leaf graph of G.