A blow-up construction and graph coloring (Q1901028): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60145534, #quickstatements; #temporary_batch_1706881316814 |
Removed claim: reviewed by (P1447): Item:Q185366 |
||
| Property / reviewed by | |||
| Property / reviewed by: Martin Loebl / rank | |||
Revision as of 19:37, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A blow-up construction and graph coloring |
scientific article |
Statements
A blow-up construction and graph coloring (English)
0 references
22 April 1996
0 references
Given a graph \(G\), a sequence of algebraic varieties is constructed whose geometry encodes combinatorial information about \(G\).
0 references
graph coloring
0 references
chromatic polynomial
0 references
