✦ LIBER ✦

Games without repetitions on digraphs

✍ Scribed by Z. Dziechcińska-Halamoda; J. Michael; W. Szwiec

Publisher: Springer
Year: 1992
Tongue: English
Weight: 413 KB
Volume: 59
Category: Article
ISSN: 0003-889X
DOI: 10.1007/bf01194854

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Games without repetitions on trees and m

Games without repetitions on trees and multitrees

✍ Z. Dziechcinska-Halamoda; J. Michael; W. Szwiec 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 341 KB

Games without repetitions on graphs with

Games without repetitions on graphs with vertex disjoint cycles

✍ Z. Dziechcińska-Halamoda; J. Michael; W. Szwiec 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 136 KB

On digraphs without antidirected cycles

✍ Douglas D. Grant; F. Jaeger; C. Payan 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

## Abstract Let __t__(__n__) denote the greatest number of arcs in a diagraph of orders __n__ which does not contain any antidrected cycles. We show that [16/5(__n__ − 1)] ≤ __t__(__n__) ≤ 1/2 (__n__ − 1) for n ≥ 5. Let __t~r~__ (__n__) denote the corresponding quantity for __r__‐colorable digraphs

On Recursive Enumeration Without Repetit

On Recursive Enumeration Without Repetition

✍ A. H. Lachlan 📂 Article 📅 1965 🏛 John Wiley and Sons 🌐 English ⚖ 709 KB

The set of attainable vectors in a repet

The set of attainable vectors in a repetitive game without side payments

✍ A.A. Vasin 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 658 KB

On Recursive Enumeration Without Repetit

On Recursive Enumeration Without Repetition: A Correction

✍ A. H. Lachlan 📂 Article 📅 1967 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB