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)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Ilya Averbouch, Benny Godlin, Johann A. Makowsky
- Eur. J. Comb.
- 2010

K.Dohmen, A.PÃ¶nitz and P.Tittman (2003), introduced a bivariate generalization of the chromatic polynomial P (G, x, y) whichâ€¦Â (More)

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

- Martin Loebl, Iain Moffatt
- 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

- Laure Helme-Guizon, Yongwu Rong
- 2005

For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graphâ€¦Â (More)

Is this relevant?

2005

2005

- Julian A. Allagan
- The Computer Science Journal of Moldova
- 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

- Klaus Dohmen, AndrÃ© Poenitz, Peter Tittmann
- Discrete Mathematics & Theoretical Computerâ€¦
- 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)

Is this relevant?

2001

2001

We study the chromatic polynomials (= zero-temperature antiferromagnetic Potts-model partition functions) PG(q) for m Ã— nâ€¦Â (More)

Is this relevant?

1997

1997

- Douglas R. Woodall
- Discrete Mathematics
- 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)

Is this relevant?

1996

1996

- C. D. Wakelin
- Journal of Graph Theory
- 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

- Earl Glen Whitehead, Lian-Chang Zhao
- Journal of Graph Theory
- 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?