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: Publication:1121920 |
scientific article; zbMATH DE number 4105018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8429878354072571
0 references
0.8233144283294678
0 references
0.8190292716026306
0 references
0.810590922832489
0 references
