✦ LIBER ✦

Completely strong path-connected tournaments

✍ Scribed by Zhang Ke-min

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 577 KB
Volume: 33
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90066-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path-connectivity in local tournaments

✍ Yubao Guo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 998 KB

A digraph T is called a local tournament if for every vertex x of T, the set of in-neighbors as well as the set of out-neighbors of x induce tournaments. We give characterizations of generalized arc-pancyclic and strongly path-panconnected local tournaments, respectively. Our results generalize thos

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

Complete classification of tournaments h

Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set

✍ Garth Isaak; Darren A. Narayan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract A feedback arc set of a digraph is a set of arcs whose reversal makes the resulting digraph acyclic. Given a tournament with a disjoint union of directed paths as a feedback arc set, we present necessary and sufficient conditions for this feedback arc set to have minimum size. We will p

Subdivisions of large complete bipartite

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs

✍ Thomas Böhme; Bojan Mohar; Riste Škrekovski; Michael Stiebitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 1 views

## Abstract It is proved that for every positive integers __k__, __r__ and __s__ there exists an integer __n__ = __n__(__k__,__r__,__s__) such that every __k__‐connected graph of order at least __n__ contains either an induced path of length __s__ or a subdivision of the complete bipartite graph __