✦ LIBER ✦

Enumeration of labeled, three-connected graphs

✍ Scribed by N. M. Bogolyubov; A. N. Vasil'ev; Yu. M. Pis'mak

Publisher: Springer US
Year: 1986
Tongue: English
Weight: 208 KB
Volume: 34
Category: Article
ISSN: 1573-8795
DOI: 10.1007/bf01095097

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of labeled, connected, homeo

Enumeration of labeled, connected, homeomorphically irreducible graphs

✍ V. A. Voblyi 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 512 KB

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

The enumeration of connected graphs and

The enumeration of connected graphs and linked diagrams

✍ Albert Nijenhuis; Herbert S Wilf 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Enumeration of finite field labels on gr

Enumeration of finite field labels on graphs

✍ Hirobumi Mizuno; Iwao Sato 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Let G be a graph, let R be a finite field and F a subgroup of the automorphism group Aut G of G. For a labeling of the vertices of G with elements of R, we consider labelings of the edges of G with elements of R such that the label on each edge is equal to the sum of labels on the two incident verti