✦ LIBER ✦

Arc-disjoint spanning sub(di)graphs in digraphs

✍ Scribed by Jørgen Bang-Jensen; Anders Yeo

Book ID: 113927729
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 266 KB
Volume: 438
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.03.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Disjoint sub(di)graphs in digraphs

✍ Jørgen Bang-Jensen; Matthias Kriesell 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Infinite, highly connected digraphs with

Infinite, highly connected digraphs with no two arc-disjoint spanning trees

✍ Ron Aharoni; Carsten Thomassen 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

Arc-Disjoint Paths in Expander Digraphs

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

Edge disjoint spanning trees in random g

Edge disjoint spanning trees in random graphs

✍ A. M. Frieze; T. Łuczak 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 145 KB

Arc-disjoint in-trees in directed graphs

✍ Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 752 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