𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering directed graphs by in-trees

✍ Scribed by Naoyuki Kamiyama; Naoki Katoh

Publisher
Springer US
Year
2009
Tongue
English
Weight
646 KB
Volume
21
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Arc-disjoint in-trees in directed graphs
Arc-disjoint in-trees in directed graphs
✍ Naoyuki Kamiyama; Naoki Katoh; Atsushi Takizawa πŸ“‚ Article πŸ“… 2009 πŸ› Springer-Verlag 🌐 English βš– 752 KB
Covers and strong covers in directed bip
Covers and strong covers in directed bipartite graphs
✍ K. Vidyasankar πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 355 KB

## Abstract Let __G__ be a finite graph with directed bipartition (__V__^+^, __V__^βˆ’^). Necessary and sufficient conditions are given for the existence of covers and strong covers that: (i) satisfy matching with respect to __V__^+^, and (ii) include a given set of edges that satisfies matching with

Min–max tree covers of graphs
Min–max tree covers of graphs
✍ G. Even; N. Garg; J. KΓΆnemann; R. Ravi; A. Sinha πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 225 KB