Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (Q2032702)
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 7358310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes |
scientific article; zbMATH DE number 7358310 |
Statements
Two classes of \(\beta \)-perfect graphs that do not necessarily have simplicial extremes (English)
0 references
14 June 2021
0 references
\( \beta \)-perfect graph
0 references
even-hole-free graph
0 references
greedy coloring algorithm
0 references
no simplicial extreme
0 references
0 references
0 references
0 references
0.86944324
0 references
0.85951173
0 references
0.85583335
0 references
0.8549724
0 references
0.8546481
0 references
0.85267204
0 references
