Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355)
From MaRDI portal
scientific article; zbMATH DE number 7781570
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
