Coloring graphs without bichromatic cycles or paths (Q2045232)
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 7381180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring graphs without bichromatic cycles or paths |
scientific article; zbMATH DE number 7381180 |
Statements
Coloring graphs without bichromatic cycles or paths (English)
0 references
12 August 2021
0 references
coloring
0 references
acyclic graph
0 references
\(P_k\)-free graph
0 references
entropy compression
0 references
0.905996024608612
0 references
0.7849923968315125
0 references
0.7817807793617249
0 references
0.7795311808586121
0 references
0.7789082527160645
0 references
