✦ LIBER ✦

The cycle structure of regular multipartite tournaments

✍ Scribed by Yubao Guo; Jin Ho Kwak

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 67 KB
Volume: 3
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80025-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycles through arcs in multipartite tour

Cycles through arcs in multipartite tournaments and a conjecture of Volkmann

✍ Hongwei Li; Shengjia Li; Yubao Guo; Qiaoping Guo 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Volkmann [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite tournaments, Appl. Math. Lett. 20 (2007Lett. 20 ( ) 1148Lett. 20 ( -1150] ] conjectured that a strong c-partite tournament with c ≥ 3 contains three arcs that belong to a cycle of length m for each m ∈ {3, 4,

The number of kings in a multipartite to

The number of kings in a multipartite tournament

✍ K.M. Koh; B.P. Tan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 401 KB

We show that in any n-partite tournament, where n/> 3, with no transmitters and no 3-kings, the number of 4-kings is at least eight. All n-partite tournaments, where n/>3, having eight 4-kings and no 3-kings are completely characterized. This solves the problem proposed in Koh and Tan (accepted).

The achromatic indices of the regular co

The achromatic indices of the regular complete multipartite graphs

✍ Nam-Po Chiang; Hung-Lin Fu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 272 KB

In this paper, we study the achromatic indices of the regular complete multipartite graphs and obtain the following results: (1) A good upper bound for the achromatic index of the regular complete multipartite graph which gives the exact values of an infinite family of graphs and solves a problem p

The star-arboricity of the complete regu

The star-arboricity of the complete regular multipartite graphs

✍ Yasukazu Aoki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 331 KB

A subgraph H of a graph G is called a star-subgraph if each component of H is a star. The star-arboricify of G, denoted by sa(G), is the minimum number of star-subgraphs that partition the edges of G. In this paper we show that sa(G) is [r/21 + 1 or [r/2] + 2 for the complete r-regular multipartite

A note on the cardinality of certain cla

A note on the cardinality of certain classes of unlabeled multipartite tournaments

✍ Gregory Gutin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 173 KB

A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are obtained of the numbers of unlabeled acyclic and unicyclic multipartite tournaments, and unlabeled bipartite tournaments with exactly k cycles, which are pairwise vertex-disjoint.

The C3-structure of the tournaments

✍ Abderrahim Boussaı&#x0308;ri; Pierre Ille; Gérard Lopez; Stéphan Thomassé 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Let T = (V; E) be a tournament. The C3-structure of T is the family C3(T ) of the subsets {x; y; z} of V such that the subtournament T ({x; y; z}) is a cycle on three vertices. In another respect, a subset X of V is an interval of T provided that for a; b ∈ X and x ∈ V -X , (a; x) ∈ E if and only if