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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Jozef Fiamčik / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jozef Fiamčik / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-003-0544-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170055425 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:47, 19 March 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