✦ LIBER ✦

The number of -free vertices on 3-partite tournaments

✍ Scribed by Ana Paulina Figueroa; Bernardo Llano; Rita Zuazua

Book ID: 108114243
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 356 KB
Volume: 310
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.06.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Paths with a given number of vertices fr

Paths with a given number of vertices from each partite set in regular multipartite tournaments

✍ Lutz Volkmann; Stefan Winzen 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 224 KB

On the number of crossing-free partition

On the number of crossing-free partitions

✍ Razen, Andreas; Welzl, Emo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 396 KB

The Number of Out-Pancyclic Vertices in

The Number of Out-Pancyclic Vertices in a Strong Tournament

✍ Qiaoping Guo, Shengjia Li, Hongwei Li, Huiling Zhao 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 194 KB

The Number of Graphs on N VERTICES WITH

The Number of Graphs on N VERTICES WITH 3 CLIQUES

✍ Reid, K. B. 📂 Article 📅 1974 🏛 Oxford University Press 🌐 English ⚖ 92 KB

Hamiltonian tournaments with the least n

Hamiltonian tournaments with the least number of 3-cycles

✍ M. Burzio; D. C. Demaria 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 2 views

## Abstract We characterize the family of hamiltonian tournaments with the least number of 3‐cycles, studying their structure and their score sequence. Furthermore, we obtain the number of nonisomorphic tournaments of this family.

IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM

IRREDUCIBLE TOURNAMENTS WITH THE MINIMUM NUMBER OF 3-CYCLES

✍ Moon, J. W. 📂 Article 📅 1993 🏛 Taylor and Francis Group 🌐 English ⚖ 315 KB