A blow-up construction and graph coloring (Q1901028)
From MaRDI portal
!
WARNING
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 810253
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A blow-up construction and graph coloring |
scientific article; zbMATH DE number 810253 |
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
0.8938908
0 references
0 references
0 references
0.88316506
0 references
0.88043296
0 references
0.87978494
0 references
