Chromatic polynomials and the symmetric group (Q1889850): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1007/s00373-003-0544-x / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1007/S00373-003-0544-X / rank
 
Normal rank

Revision as of 11:57, 16 December 2024

scientific article
Language Label Description Also known as
English
Chromatic polynomials and the symmetric group
scientific article

    Statements

    Chromatic polynomials and the symmetric group (English)
    0 references
    0 references
    13 December 2004
    0 references
    The author gives a new combinatorial interpretation of the coefficients of chromatic polynomials of graphs in terms of subsets of permutations and introduces a combinatorially defined polynomial associated to a directed graph. He proves that it is related to the chromatic polynomials. These polynomials are a specialization of the cover polynomials of digraphs. Some open questions are posed too.
    0 references
    linear ordering
    0 references

    Identifiers