✦ LIBER ✦

Orthogonal Structures in Directed Graphs

✍ Scribed by S. Felsner

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 472 KB
Volume: 57
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1023

No coin nor oath required. For personal study only.

✦ Synopsis

Using the minimal cost flow algorithm of Ford and Fulkerson and the notion of orthogonality between chain and antichain families András Frank could give common access (and proof) to some famous results in the theory of finite posets:

📜 SIMILAR VOLUMES

Orthogonally Drawing Cubic Graphs in Par

Orthogonally Drawing Cubic Graphs in Parallel

✍ Tiziana Calamoneri; Rossella Petreschi 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 417 KB

Hamilton cycles in random graphs and dir

Hamilton cycles in random graphs and directed graphs

✍ Colin Cooper; Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 3 views

ChemInform Abstract: Properties of New O

ChemInform Abstract: Properties of New Orthogonal Graph Theoretical Invariants in Structure—Property Correlations.

✍ Oswaldo Araujo; Daniel A. Morales 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 24 KB

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

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

Optimal tree 3-spanners in directed path

Optimal tree 3-spanners in directed path graphs

✍ Le, Ho�ng-Oanh; Le, Van Bang 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB 👁 2 views

In a graph G, a spanning tree T is called a tree t-spanner of G if the distance between any two vertices in T is at most t times their distance in G. While the complexity of finding a tree t-spanner of a given graph is known for any fixed t 3, the case t ϭ 3 still remains open. In this article, we s