𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the existence of (k, l)-kernels in digraphs

✍ Scribed by Hortensia Galeana-Sánchez

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
264 KB
Volume
85
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

On the number of quasi-kernels in digrap
On the number of quasi-kernels in digraphs
✍ Gregory Gutin; Khee Meng Koh; Eng Guan Tay; Anders Yeo 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

## Abstract A vertex set __X__ of a digraph __D__ = (__V, A__) is a __kernel__ if __X__ is independent (i.e., all pairs of distinct vertices of __X__ are non‐adjacent) and for every __v__ ∈ __V__‐__X__ there exists __x__ ∈ __X__ such that __vx__ ∈ __A__. A vertex set __X__ of a digraph __D__ = (__V

Note on the existence of directed (k + 1
Note on the existence of directed (k + 1)-cycles in diconnected complete k-partite digraphs
✍ R. Balakrishnan; P. Paulraja 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

A graph is constructed to provide a negative answer to the following question of Bondy: Does every diconnected orientation of a complete k-partite (k 2 5) graph with each part of size at least 2 yield a directed (k + 1)-cycle?

On the existence of a specified cycle in
On the existence of a specified cycle in digraphs with constraints on degrees
✍ Abdelhamid Benhocine 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 326 KB 👁 1 views

We prove that Woodall's and GhouileHouri's conditions on degrees which ensure that a digraph is Hamiltonian, also ensure that it contains the analog of a directed Hamiltonian cycle but with one edge pointing the wrong way; that is, it contains two vertices that are connected in the same direction by

On the existence of resolvable K4 − e de
On the existence of resolvable K4 − e designs
✍ Gennian Ge; Alan C. H. Ling 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 1 views

## Abstract In this article, we settle a problem which originated in 4 regarding the existence of resolvable (__K__~4~ − __e__)‐design. We solve the problem with two possible exceptions. © 2007 Wiley Periodicals, Inc. J Combin Designs 15: 502–510, 2007

On the existence of rainbows in 1-factor
On the existence of rainbows in 1-factorizations of K2n
✍ David E. Woolbright; Hung-Lin FU 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

A 1-factor of a graph G = (V, E) is a collection of disjoint edges which contain all the vertices of V . Given a 2n -1 edge coloring of K2n, n ≥ 3, we prove there exists a 1-factor of K2n whose edges have distinct colors. Such a 1-factor is called a ''Rainbow.''