Graphs and Combinatorics

, Volume 20, Issue 1, pp 131–144 | Cite as

Chromatic Polynomials and the Symmetric Group

  • Philippe Pitteloud


In this paper we give first a new combinatorial interpretation of the coefficients of chromatic polynomials of graphs in terms of subsets of permutations. Motivated by this new interpretation, we introduce next a combinatorially defined polynomial associated to a directed graph, and prove that it is related to chromatic polynomials. These polynomials are a specialization of cover polynomials of digraphs.


Directed Graph Symmetric Group Combinatorial Interpretation Chromatic Polynomial Cover Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Tokyo 2004

Authors and Affiliations

  1. 1.Indian Institute of ScienceMathematics DepartmentBangaloreIndia

Personalised recommendations