A blow-up construction and graph coloring (Q1901028): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4310091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular elements of geometric lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3028888 / rank
 
Normal rank

Revision as of 17:56, 23 May 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
    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
    0 references
    graph coloring
    0 references
    chromatic polynomial
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references