Characterising and recognising game-perfect graphs (Q5377789)
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: Characterising and recognising game-perfect graphs |
scientific article; zbMATH DE number 7059446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterising and recognising game-perfect graphs |
scientific article; zbMATH DE number 7059446 |
Statements
27 May 2019
0 references
graph colouring game
0 references
game chromatic number
0 references
game-perfect graph
0 references
perfect graph
0 references
dominating edge decomposition
0 references
clique module decomposition
0 references
forbidden induced subgraph characterisation
0 references
math.CO
0 references
0.8588825464248657
0 references
0.8518515825271606
0 references
0.8255206346511841
0 references
0.817836582660675
0 references
0.7795652151107788
0 references
