✦ LIBER ✦

Disjoint Paths in Acyclic Digraphs

✍ Scribed by A. Metzlar

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Matrix for Counting Paths in Acyclic D

A Matrix for Counting Paths in Acyclic Digraphs

✍ Richard P. Stanley 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 178 KB

We define a matrix A associated with an acyclic digraph 1, such that the coefficient of z j in det(I+zA) is the number of j-vertex paths in 1. This result is actually a special case of a more general weighted version.

Disjoint quasi-kernels in digraphs

✍ Scott Heard; Jing Huang 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract A __quasi‐kernel__ in a digraph is an independent set of vertices such that any vertex in the digraph can reach some vertex in the set via a directed path of length at most two. Chvátal and Lovász proved that every digraph has a quasi‐kernel. Recently, Gutin et al. raised the question o

Packing paths in digraphs

✍ Richard C. Brewster; Pavol Hell; Sarah H. Pantel; Romeo Rizzi; Anders Yeo 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB

## Abstract Let ${\cal G}$ be a fixed set of digraphs. Given a digraph __H__, a ${\cal G}$‐packing in __H__ is a collection ${\cal P}$ of vertex disjoint subgraphs of __H__, each isomorphic to a member of ${\cal G}$. A ${\cal G}$‐packing ${\cal P}$ is __maximum__ if the number of vertices belonging

Disjoint T-paths in tough graphs

✍ Tomáš Kaiser 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

## Abstract Let __G__ be a graph and __T__ a set of vertices. A __T‐path__ in __G__ is a path that begins and ends in __T__, and none of its internal vertices are contained in __T__. We define a __T‐path covering__ to be a union of vertex‐disjoint __T__‐paths spanning all of __T__. Concentrating on

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.

Maximum directed cuts in acyclic digraph

Maximum directed cuts in acyclic digraphs

✍ Noga Alon; Béla Bollobás; András Gyárfás; Jenő Lehel; Alex Scott 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

## Abstract It is easily shown that every digraph with __m__ edges has a directed cut of size at least __m__/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of the largest directed cut in __acyclic__ digraphs, and prove a number of related results concerning cuts