✦ LIBER ✦

Independent arborescences in directed graphs

✍ Scribed by Frank, András; Fujishige, Satoru; Kamiyama, Naoyuki; Katoh, Naoki

Book ID: 118275944
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 227 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.11.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Independent Directed Triangles in a Dire

Independent Directed Triangles in a Directed Graph

✍ Hong WangRID="*"ID="*" This research was supported by UIRC SEED GRANTS–KDY932 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 124 KB

On directed graphs with an independent c

On directed graphs with an independent covering set

✍ E. C. Milner; Robert E. Woodrow 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 456 KB

Directed triangles in directed graphs

✍ M. de Graaf; A. Schrijver; P.D. Seymour 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 212 KB

de Graaf, M., A. Schrijver and P.D. Seymour, Directed triangles in directed graphs, Discrete Mathematics 110 (1992) 279-282. h on n vertices, each with indegree and outdegree at least n/t, contains a directed circuit of length at most

A linear-time algorithm to find a pair o

A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph

✍ Kristóf Bérczi; Satoru Fujishige; Naoyuki Kamiyama 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 185 KB

Independent sets in direct products of v

Independent sets in direct products of vertex-transitive graphs

✍ Huajun Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 147 KB

Disproof of a conjecture about independe

Disproof of a conjecture about independent branchings in k-connected directed graphs

✍ Andreas Huck 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB 👁 1 views

## Abstract For each __k__ ≥ 3, we construct a finite directed strongly __k__‐connected graph __D__ containing a vertex __t__ with the following property: For any __k__ spanning __t__‐branchings, __B__~1~, …, __B__~__k__~ in __D__ (i. e., each __B__~__i__~ is a spanning tree in __D__ directed towar