Kernels in digraphs with covering number at most 3 (Q1861206): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Matúš Harminc / rank | |||
Property / reviewed by | |||
Property / reviewed by: Matúš Harminc / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(02)00375-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2051805884 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:30, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Kernels in digraphs with covering number at most 3 |
scientific article |
Statements
Kernels in digraphs with covering number at most 3 (English)
0 references
16 March 2003
0 references
A digraph \(D\) is said to be kernel-perfect if every proper induced subdigraph of \(D\) possesses a kernel. In 1998, the author (with her coauthor Xuliang Li) published two sufficient conditions for a digraph \(D\) to be kernel-perfect, concerning digraphs with the covering number at most three, containing only symmetrical directed triangles. In this paper the class of \(M\)-oriented digraphs is considered and a common generalization of both previous conditions is presented. The main result is the following one: Let every directed triangle of a digraph \(D\) have at least two symmetrical arcs. If each directed cycle of length five in \(D\) has two diagonals or three symmetrical arcs, then \(D\) is kernel-perfect.
0 references
kernel
0 references
kernel-perfect digraph
0 references
covering number
0 references