Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable (Q1196561): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3822191 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On kernels in perfect graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Kernels in some orientations of comparability graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parity graphs are kernel-M-solvable / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Almost all Berge Graphs are Perfect / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02350628 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091248144 / rank | |||
Normal rank | |||
Latest revision as of 09:19, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable |
scientific article |
Statements
Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable (English)
0 references
16 January 1993
0 references
perfectly orderable graphs
0 references
kernel \(M\)-solvable
0 references
acyclic orientation
0 references
perfect graphs
0 references
