Making an H $H$‐free graph k $k$‐colorable (Q6093148)
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 7746566
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Making an H $H$‐free graph k $k$‐colorable |
scientific article; zbMATH DE number 7746566 |
Statements
Making an H $H$‐free graph k $k$‐colorable (English)
0 references
6 October 2023
0 references
extremal graph theory
0 references
forbidden subgraph
0 references
max-cut
0 references
0 references
0 references
0.9016079
0 references
0.8897072
0 references
0 references
0 references
0 references
0.87412447
0 references
0 references
