The coloring ideal and coloring complex of a graph (Q5949016): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Expansions of Chromatic Polynomials and Log-Concavity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbert polynomials in combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path-cycle symmetric function of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover polynomial of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symmetric function generalization of the chromatic polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorics and commutative algebra. / rank
 
Normal rank

Latest revision as of 21:21, 3 June 2024

scientific article; zbMATH DE number 1672614
Language Label Description Also known as
English
The coloring ideal and coloring complex of a graph
scientific article; zbMATH DE number 1672614

    Statements

    The coloring ideal and coloring complex of a graph (English)
    0 references
    3 June 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    chromatic polynomial
    0 references
    monomial ideal
    0 references
    simplicial complex
    0 references
    Stanley-Reisner ring
    0 references
    Hilbert polynomial
    0 references
    Euler characteristic
    0 references
    acyclic orientation
    0 references
    0 references