Parity graphs are kernel-M-solvable (Q1121920)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parity graphs are kernel-M-solvable |
scientific article; zbMATH DE number 4105018
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parity graphs are kernel-M-solvable |
scientific article; zbMATH DE number 4105018 |
Statements
Parity graphs are kernel-M-solvable (English)
0 references
1987
0 references
orientation
0 references
parity graph
0 references
perfect graphs
0 references
