✦ LIBER ✦

Disjoint sub(di)graphs in digraphs

✍ Scribed by Jørgen Bang-Jensen; Matthias Kriesell

Book ID: 108120705
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 164 KB
Volume: 34
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2009.07.030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arc-disjoint spanning sub(di)graphs in d

Arc-disjoint spanning sub(di)graphs in digraphs

✍ Jørgen Bang-Jensen; Anders Yeo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Disjoint cycles in digraphs

✍ Carsten Thomassen 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 209 KB

Disjoint Cycles in Eulerian Digraphs and

Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs

✍ Richard A. Brualdi; Jian Shen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 87 KB

denote the set of all m × n {0, 1}-matrices with row sum vector R and column sum vector S. Suppose A(R, S) ] ". The interchange graph G(R, S) of A(R, S) was defined by Brualdi in 1980. It is the graph with all matrices in A(R, S) as its vertices and two matrices are adjacent provided they differ by

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

Disjoint Paths in Acyclic Digraphs

✍ A. Metzlar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 455 KB

Arc-Disjoint Paths in Expander Digraphs

✍ Bohman, Tom; Frieze, Alan 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 235 KB