Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355)
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 7781570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded |
scientific article; zbMATH DE number 7781570 |
Statements
Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (English)
0 references
21 December 2023
0 references
\( \chi \)-boundedness
0 references
geometric intersection graphs
0 references
0 references
0.8921618
0 references
0.8632643
0 references
0.8546181
0 references
0.8546181
0 references
0.85387605
0 references
0.85241944
0 references
0.8504934
0 references
0.84727556
0 references
0.8462198
0 references
0.8458705
0 references
