✦ LIBER ✦

Counting patterns in graphs

✍ Scribed by Guido Guardabassi

Book ID: 107883985
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 326 KB
Volume: 13
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90004-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting Matchings in Graphs

✍ E.J. Farrell 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A general formula is derivedfor the matching polynomial of an arbitrary graph G. This yields a methodfor counting matchings in graphs. From the general formula, explicit formulae are deducedfor the number of k-matchings in several well-known families of graphs.

Counting cubic graphs

✍ Robert W. Robinson 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

Counting disk graphs

✍ Colin McDiarmid; Tobias Müller 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 181 KB

A comparison between 1-factor count and

A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs

✍ Heping Zhang; Jinghua He 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 110 KB

Counting labelled chordal graphs

✍ Nicholas C. Wormald 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 427 KB

Counting H-free graphs

✍ Hans Jürgen Prömel; Angelika Steger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Let Forb",, (H) denote the class of all H-free graphs on n (labelled) vertices with m edges. In this note we estimate the cardinality of IForb,, by establishing good bounds for the probability that a random graph in the G(n,m)-model does not contain a given subgraph.