✦ LIBER ✦

Kernels in directed graphs: a poison game

✍ Scribed by P. Duchet; H. Meyniel

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 282 KB
Volume: 115
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90496-g

No coin nor oath required. For personal study only.

✦ Synopsis

We consider a two player game on a progressively and locally finite directed graph and we prove that the first player wins if and only if the graph has a local kernel. The result is sharp. From it, we derive a short proof of a general version of the Galeana-Sanchez & Neuman-Lara Theorem that give a sufficient condition for a digraph to be kernel-perfect.

📜 SIMILAR VOLUMES

On the existence of kernels and h-kernel

On the existence of kernels and h-kernels in directed graphs

✍ H. Galeana-Sánchez 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 272 KB

Recent problems and results about kernel

Recent problems and results about kernels in directed graphs

✍ C. Berge; P. Duchet 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 355 KB

In Section 1, we survey the existence theorems for a kernel; in Section 2, we discuss a new conjecture which could constitute a bridge between the kernel problems and the perfect graph conjecture. In fact, we believe that a graph is 'quasi-perfect' if and only if it is perfect. ## Proposition 1.1.

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

Kernels in graphs with a clique-cutset

✍ Henry Jacob 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 138 KB

We consider graphs that have a clique-cutset, and we show that this property preserves the existence of a kernel in a certain sense. We consider finite directed graphs that do not have multiple arcs or loops, but there may be symmetric arcs between some pairs of vertices. Let G = (V, A) be a direct

Enumerating the kernels of a directed gr

Enumerating the kernels of a directed graph with no odd circuits

✍ Jayme L. Szwarcfiter; Guy Chaty 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Disjoint directed quadrilaterals in a di

Disjoint directed quadrilaterals in a directed graph

✍ Danhong Zhang; Hong Wang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB

## Abstract Let __D__ be a directed graph of order 4__k__, where __k__ is a positive integer. Suppose that the minimum degree of __D__ is at least 6__k__ − 2. We show that __D__ contains __k__ disjoint directed quadrilaterals with only one exception. © 2005 Wiley Periodicals, Inc. J Graph Theory