Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,332,642 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
32 relations
Acyclic orientation
Algebraic graph theory
Branch and bound
Bull graph
Expand
Broader (1)
Graph coloring
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Buchstaber numbers and classical invariants of simplicial complexes
A. Ayzenberg
2014
Corpus ID: 119130466
Buchstaber invariant is a numerical characteristic of a simplicial complex, arising from torus actions on moment-angle complexes…
Expand
2014
2014
Chromatic Polynomials Of Some (m, l)-Hyperwheels
Julian A. Allagan
Comput. Sci. J. Moldova
2014
Corpus ID: 18092899
In this paper, using a standard method of computing the chromatic polynomial of hypergraphs, we introduce a new reduction theorem…
Expand
2011
2011
A generalization of the Birthday problem and the chromatic polynomial
Sukhada Fadnavis
2011
Corpus ID: 118629134
The birthday paradox states that there is at least a 50% chance that some two out of twenty-three randomly chosen people will…
Expand
2011
2011
CHROMATIC POLYNOMIALS OF CERTAIN FAMILIES OF DENDRIMER NANOSTARS
N. Arif
,
R. Hasni
,
S. Alikhani
2011
Corpus ID: 125641649
λ -colouring of G if ) ( ) ( v f u f ≠ whenever the vertices u and v are adjacent in G. The number of distinct λ -colourings of G…
Expand
2010
2010
Chromatic polynomials of complementary (n,k)-clique pairs
A. Bohn
2010
Corpus ID: 119722721
We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair…
Expand
2010
2010
Frequency-specific color adaptation in the human visual system *
B. Breitmeyer
,
L. Cooper
2010
Corpus ID: 139090195
Following prolonged exposure to two vertical grating patterns differing in spatial frequency-one pattern illuminated in green…
Expand
2009
2009
Some Results on Chromatic Polynomials of Hypergraphs
Manfred Walter
Electronic Journal of Combinatorics
2009
Corpus ID: 714021
In this paper, chromatic polynomials of (non-uniform) hypercycles, unicyclic hypergraphs, hypercacti and sunflower hypergraphs…
Expand
2008
2008
CHROMATIC AND TUTTE POLYNOMIALS FOR GRAPHS , ROOTED GRAPHS AND TREES
Gary Gordon
2008
Corpus ID: 14656275
The chromatic polynomial of a graph is a one-variable polynomial that counts the number of ways the vertices of a graph can be…
Expand
Review
2004
Review
2004
A review on the chromatic segementation
Mao-Jun He
2004
Corpus ID: 124361358
Image segmentation is the basis of the image understanding ,and one of the most important issues in the area of the image…
Expand
1993
1993
Lower bounds and upper bounds for chromatic polynomials
Klaus Dohmen
Journal of Graph Theory
1993
Corpus ID: 206080317
In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on n vertices having m…
Expand