Some operations preserving the existence of kernels (Q1301845): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3680833 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect graphs are kernel solvable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Latest revision as of 22:30, 28 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some operations preserving the existence of kernels |
scientific article |
Statements
Some operations preserving the existence of kernels (English)
0 references
26 April 2000
0 references
The join operation of two graphs, the adjacent duplication and the non-adjacent duplication of a vertex are introduced. The resulting graphs or their orientations are investigated from the point of view of kernel-perfectness, of solvability and of existence of kernels, respectively.
0 references
kernels of digraphs
0 references
solvability of graphs
0 references
0 references
