𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Disjoint cycles in digraphs

✍ Scribed by Carsten Thomassen

Book ID
110564245
Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
209 KB
Volume
3
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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
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