Perfect graphs with polynomially computable kernels (Q2283107)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7146790
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect graphs with polynomially computable kernels |
scientific article; zbMATH DE number 7146790 |
Statements
Perfect graphs with polynomially computable kernels (English)
0 references
30 December 2019
0 references
chordal graph
0 references
claw-free perfect graph
0 references
clique-cutset
0 references
kernel
0 references
orientation of perfect graph
0 references
Boros-Gurvich theorem
0 references
0 references
0 references
0 references
0.853168785572052
0 references
0.8421319723129272
0 references
0.8337703347206116
0 references
0.8223155736923218
0 references
