Chromatic polynomial

The chromatic polynomial is a polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2017
0102019732017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
K.Dohmen, A.Pönitz and P.Tittman (2003), introduced a bivariate generalization of the chromatic polynomial P (G, x, y) which… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2008
2008
We consider proper colorings of planar graphs embedded in the annulus, such that vertices on one rim can take Qs colors, while… (More)
Is this relevant?
2008
2008
Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory… (More)
Is this relevant?
2005
2005
For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2005
2005
We prove that if an edge of a cycle on n vertices is extended by adding k vertices, then the the chromatic polynomial of such… (More)
Is this relevant?
2003
2003
Let P(G;x,y) be the number of vertex colorings φ : V →{1, ...,x} of an undirected graph G = (V,E) such that for all edges {u,v… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2001
2001
We study the chromatic polynomials (= zero-temperature antiferromagnetic Potts-model partition functions) PG(q) for m × n… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
1997
1997
It is proved that if every subcontraction of a graph G contains a vertex with degree at most k, then the chromatic polynomial of… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1996
1996
In this paper we present some results on the sequence of coefficients of the chromatic polynomial of a graph relative to the… (More)
Is this relevant?
1984
1984
We prove that the multiplicity of the root 1 in the chromatic polynomial of a simple graph G is equal to the number of nontrivial… (More)
Is this relevant?