Let D be a digraph with V (D) and A(D) the sets of vertices and arcs of D, respectively. A kernel of D is a set I ⊂ V (D) such that no arc of D joins two vertices of I and for each x ∈ V (D) \ I there is a vertex y ∈ I such that (x, y) ∈ A(D). A digraph is kernel-perfect if every non-empty induced subdigraph of D has a kernel. If D is edge coloured, we define the closure ξ(D) of D the multidigraph with V (ξ(D)) = V (D) and A (ξ(D)) = i {(u, v) with colour i : there exists a monochromatic path of colour i from the vertex u to the vertex v contained in D}. Let T 3 and C 3 denote the transitive tournament of order 3 and the 3-cycle, respectively, both of whose arcs are coloured with 3 different colours. In this paper, we survey sufficient conditions for the existence of kernels in the closure of edge coloured digraphs, also we prove that if D is obtained from an edge coloured tournament by deleting one arc and D does not contain T 3 or C 3 , then ξ(D) is a kernel-perfect digraph.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.