Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree (Q6046682): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q114236116, #quickstatements; #temporary_batch_1714653054045 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114236116 / rank | |||
Normal rank | |||
Latest revision as of 14:43, 2 May 2024
scientific article; zbMATH DE number 7746578
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree |
scientific article; zbMATH DE number 7746578 |
Statements
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree (English)
0 references
6 October 2023
0 references
bipartite graphs
0 references
induced subgraphs
0 references
