Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00454-023-00592-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00454-023-00592-Z / rank | |||
Normal rank | |||
Latest revision as of 19:50, 30 December 2024
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
