✦ LIBER ✦

Independent Directed Triangles in a Directed Graph

✍ Scribed by Hong WangRID="*"ID="*" This research was supported by UIRC SEED GRANTS–KDY932

Book ID: 105745121
Publisher: Springer Japan
Year: 2000
Tongue: English
Weight: 124 KB
Volume: 16
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007230

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Directed Triangles in Digraphs

✍ Jian Shen 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 144 KB

Let c be the smallest possible value such that every digraph on n vertices with minimum outdegree at least cn contains a directed triangle. It was conjectured by Caccetta and Ha ggkvist in 1978 that c=1Â3. Recently Bondy showed that c (2 -6&3)Â5=0.3797... by using some counting arguments. In this no

Disjoint directed quadrilaterals in a di

Disjoint directed quadrilaterals in a directed graph

✍ Danhong Zhang; Hong Wang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract Let __D__ be a directed graph of order 4__k__, where __k__ is a positive integer. Suppose that the minimum degree of __D__ is at least 6__k__ − 2. We show that __D__ contains __k__ disjoint directed quadrilaterals with only one exception. © 2005 Wiley Periodicals, Inc. J Graph Theory

Packing rooted directed cuts in a weight

Packing rooted directed cuts in a weighted directed graph

✍ D. R. Fulkerson 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 545 KB

Independent arborescences in directed gr

Independent arborescences in directed graphs

✍ Frank, András; Fujishige, Satoru; Kamiyama, Naoyuki; Katoh, Naoki 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 227 KB

Directed star decompositions of the comp

Directed star decompositions of the complete directed graph

✍ Charles J. Colbourn; D. G. Hoffman; C. A. Rodger 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB

## Abstract An (__s, t__)‐directed star is a directed graph with __s__ + __t__ + 1 vertices and s + t arcs; s vertices have indegree zero and outdegree one, __t__ have indegree one and outdegree zero, and one has indegree __s__ and outdegree __t__. An (__s, t__)‐directed star decomposition is a par