✦ LIBER ✦

Disjoint directed quadrilaterals in a directed graph

✍ Scribed by Danhong Zhang; Hong Wang

Publisher: John Wiley and Sons
Year: 2005
Tongue: English
Weight: 139 KB
Volume: 50
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20096

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Edge-disjoint cycles in regular directed

Edge-disjoint cycles in regular directed graphs

✍ Alon, Noga; McDiarmid, Colin; Molloy, Michael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB 👁 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996

Vertex-disjoint paths and edge-disjoint

Vertex-disjoint paths and edge-disjoint branchings in directed graphs

✍ R. W. Whitty 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

A theorem of J. Edmonds states that a directed graph has k edge-disjoint branchings rooted at a vertex r if and only if every vertex has k edge-disjoint paths to r . We conjecture an extension of this theorem to vertex-disjoint paths and give a constructive proof of the conjecture in the case k = 2.

A recursive algorithm for directed-graph

A recursive algorithm for directed-graph reliability

✍ J. A. Buzacott 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

Disjoint Cycles in Directed Graphs on th

Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle

✍ G.L. Ding; A. Schrijver; P.D. Seymour 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 203 KB

We give necessary and sufficient conditions for a directed graph embedded on the torus or the Klein bottle to contain pairwise disjoint circuits, each of a given orientation and homotopy, and in a given order. For the Klein bottle, the theorem is new. For the torus, the theorem was proved before by

A phase transition phenomenon in a rando

A phase transition phenomenon in a random directed acyclic graph

✍ B. Pittel; R. Tungol 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

Let a random directed acyclic graph be defined as being obtained from the random graph G n p by orienting the edges according to the ordering of vertices. Let γ \* n be the size of the largest (reflexive, transitive) closure of a vertex. For p = c log n /n, we prove that, with high probability, γ \*

On the spectral radius of a directed gra

On the spectral radius of a directed graph

✍ Kwapisz, Jaroslaw 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB 👁 2 views

We provide upper estimates on the spectral radius of a directed graph. In particular w e prove that the spectral radius is bounded by the maximum of the geometric mean of in-degree and out-degree taken over all vertices.