Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Chromatic polynomial

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
This paper will provide an introduction to chromatic polynomials. We will first define chromatic polynomials and related terms… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Silica-based highly nonlinear fibers (HNLFs) have been utilized as platforms for various applications, including fiber lasers… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We propose an approach for the measurement of microwave frequency in the optical domain with adjustable measurement range and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We show that there exist universal constants C(r) < ∞ such that, for all loopless graphs G of maximum degree ≤ r, the zeros (real… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The maximal zero-free intervals for chromatic polynomials of graphs are precisely (−∞, 0), (0, 1), (1, 32/27]. We also… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Let G be a graph and P ( G, t ) be the chromatic polynomial of G . It is known that P ( G, t ) has no zeros in the intervals… Expand
Is this relevant?
1992
1992
The main results established are (i) a connection between the matching and chromatic polynomials and (ii) a formula for the… Expand
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… Expand
Is this relevant?
1982
1982
We continue the study initiated in ''Signed graph coloring'' of the chromatic and Whitney polynomials of signed graphs. In this… Expand
Is this relevant?