✦ LIBER ✦

Cycles through arcs in multipartite tournaments and a conjecture of Volkmann

✍ Scribed by Hongwei Li; Shengjia Li; Yubao Guo; Qiaoping Guo

Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 213 KB
Volume: 24
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2010.10.022

No coin nor oath required. For personal study only.

✦ Synopsis

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, . . . , c}. In this work, we prove that Volkmann's conjecture is true.

📜 SIMILAR VOLUMES

A remark on cycles through an arc in str

A remark on cycles through an arc in strongly connected multipartite tournaments

✍ Lutz Volkmann 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A multipartite or c-partite tournament is an orientation of a complete c-partite graph. In this note we prove that a strongly connected c-partite tournament with c ≥ 3 contains an arc that belongs to a directed cycle of length m for every m ∈ {3, 4, . . . , c}.

Solution of a conjecture of Tewes and Vo

Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments

✍ Dirk Meierling 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB 👁 1 views

## Abstract A directed cycle __C__ of a digraph __D__ is extendable if there exists a directed cycle __C__′ in __D__ that contains all vertices of __C__ and an additional one. In 1989, Hendry defined a digraph __D__ to be cycle extendable if it contains a directed cycle and every non‐Hamiltonian di

Solution of a conjecture of Volkmann on

Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments

✍ Dirk Meierling 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 1 views

## Abstract An in‐tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. Let __m__ = 4 or __m__ = 5 and let __D__ be a strongly connected in‐tournament of order ${{n}}\geq {{2}}{{m}}-{{2}}$ such that each arc belongs to a directed path of order at

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

BASAL LEVELS OF METALLOTHIONEIN I AND II

BASAL LEVELS OF METALLOTHIONEIN I AND II EXPRESSION IN MOUSE EMBRYO FIBROBLASTS ENHANCE GROWTH IN LOW FOLATE THROUGH A CELL CYCLE MEDIATED PATHWAY

✍ Wei-Yong Zhu; Peter W. Melera 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 286 KB