✦ LIBER ✦

Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs

✍ Scribed by Gregory Gutin; Anders Yeo

Book ID: 106048068
Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 86 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730170022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the number of increasing paths in lab

On the number of increasing paths in labeled cycles and stars

✍ Lei Chen; Changhong Lü; Yongsheng Ye 📂 Article 📅 2007 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 119 KB