✦ LIBER ✦

On the cores of games arising from integer edge covering functions of graphs

✍ Scribed by Boram Park, Suh-Ryung Kim, Hye Kyung Kim

Book ID: 120694151
Publisher: Springer US
Year: 2012
Tongue: English
Weight: 529 KB
Volume: 26
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-012-9484-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer Functions on the Cycle Space and

Integer Functions on the Cycle Space and Edges of a Graph

✍ Daniel C. Slilaty 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 114 KB

On the core of information graph games

✍ Jeroen Kuipers 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 626 KB

On the edge cover polynomial of a graph

✍ Saieed Akbari; Mohammad Reza Oboudi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 363 KB

On the roots of edge cover polynomials o

On the roots of edge cover polynomials of graphs

✍ Péter Csikvári; Mohammad Reza Oboudi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 235 KB

The core of games on ordered structures

The core of games on ordered structures and graphs

✍ Michel Grabisch 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 639 KB

The generating function of irreducible c

The generating function of irreducible coverings by edges of complete k-partite graphs

✍ Virgil Domocos; Ş.N. Buzeţeanu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 208 KB

A generalization of a recent result of Tomescu ( 1993) is presented. The method is purely combinatorial and is based on the theory of species of several variables.