𝔖 Bobbio Scriptorium
✦   LIBER   ✦

k-Linked and k-cyclic digraphs

✍ Scribed by Yannis Manoussakis

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
838 KB
Volume
48
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On k-strong and k-cyclic digraphs
On k-strong and k-cyclic digraphs
✍ JΓΈrgen Bang-Jensen; Gregory Gutin; Anders Yeo πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 627 KB

Thomassen (1991) proved that there is no degree of strong connectivity which guarantees a cycle through two given vertices in a digraph. In this paper we consider a large family of digraphs, including symmetric digraphs (i.e. digraphs obtained from undirected graphs by replacing each edge by a di

On the existence of (k, l)-kernels in di
On the existence of (k, l)-kernels in digraphs
✍ Hortensia Galeana-SΓ‘nchez πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 264 KB

In this paper we present some results on the existence of /c-kernels and (k, [)-kernels in digraphs which generalize the following Theorem of P. Duchet [2]: "If every directed cycle of odd length in a digraph D has at least two symmetrical arcs, then D has a kernel.

K-linked graphs with girth condition
K-linked graphs with girth condition
✍ Ken-ichi Kawarabayashi πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 55 KB

## Abstract Recently, Mader [7] proved that every 2__k__‐connected graph with girth __g__(__G__) sufficiently large is __k__‐linked. We show here that __g__(__G__ β‰₯ 11 will do unless __k__ = 4,5. If __k__ = 4,5, then __g__(__G__) β‰₯ 19 will do. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 45: 48–50