✦ LIBER ✦

Determining uni-connectivity in directed graphs

✍ Scribed by Adam L. Buchsbaum; Martin C. Carlisle

Book ID: 103103528
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 328 KB
Volume: 48
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90261-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algebraic connectivity of directed graph

Algebraic connectivity of directed graphs

✍ Wu, Chai Wah 📂 Article 📅 2005 🏛 Taylor and Francis Group 🌐 English ⚖ 210 KB

Testing Eulerianity and connectivity in

Testing Eulerianity and connectivity in directed sparse graphs

✍ Yaron Orenstein; Dana Ron 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Problems concerning global connectivity

Problems concerning global connectivity of directed graphs

✍ Jørgen Bang-Jensen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Finding the edge connectivity of directe

Finding the edge connectivity of directed graphs

✍ Yishay Mansour; Baruch Schieber 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 577 KB

Strong Connectivity in Directional Neare

Strong Connectivity in Directional Nearest-Neighbor Graphs

✍ Flinchbaugh, B. E.; Jones, L. K. 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics ⚖ 249 KB

Directed triangles in directed graphs

✍ M. de Graaf; A. Schrijver; P.D. Seymour 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 212 KB

de Graaf, M., A. Schrijver and P.D. Seymour, Directed triangles in directed graphs, Discrete Mathematics 110 (1992) 279-282. h on n vertices, each with indegree and outdegree at least n/t, contains a directed circuit of length at most