Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 223,558,362 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.
2016
2016
A spatially variant total variational model for chromatic aberration correction
Ling Pi
,
Wei Wang
,
M. Ng
Journal of Visual Communication and Image…
2016
Corpus ID: 5854944
Review
2010
Review
2010
CHROMATIC POLYNOMIALS OF SOME NANOTUBES
S. Alikhani
,
M. Iranmanesh
2010
Corpus ID: 5349458
Let ) , ( λ χ G denotes the number of proper vertex colourings of with at most G λ colours. G. Birkhoff , observed in 1912 that…
Expand
2008
2008
Bidirectional reconfigurable optical add-drop multiplexer with power compensation built-in optical amplifiers
S. Liaw
,
Yao-Sheng Hsieh
,
Wan-Lin Cheng
,
Chu-Lin Chang
,
Hong-Fu Ting
2008
Corpus ID: 62731842
A power-compensated bidirectional reconfigurable optical add-drop multiplexer (Bi-ROADM) based on tunable fiber Bragg gratings is…
Expand
2006
2006
Color Features for Image Fingerprinting
M. Gavrielides
,
E. Sikudová
,
D. Spachos
,
I. Pitas
Hellenic Conference on Artificial Intelligence
2006
Corpus ID: 15854474
Image fingerprinting systems aim to extract unique and robust image descriptors (in analogy to human fingerprints). They search…
Expand
1997
1997
Choice number of 3-colorable elementary graphs
Sylvain Gravier
,
Frédéric Maffray
Discrete Mathematics
1997
Corpus ID: 11771175
Review
1997
Review
1997
The search for chromatically unique graphs - II
K. Koh
,
K. Teo
Discrete Mathematics
1997
Corpus ID: 28340811
1994
1994
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
K. Koh
,
K. Teo
Discrete Mathematics
1994
Corpus ID: 12020041
1986
1986
Bijective proofs of two broken circuit theorems
A. Blass
,
B. Sagan
Journal of Graph Theory
1986
Corpus ID: 18070706
On demontre, a l'aide de bijections explicites, les theoremes de Whitney et de Stanley qui expriment les coefficients du polynome…
Expand
Highly Cited
1984
Highly Cited
1984
Cutpoints and the chromatic polynomial
Earl Glen Whitehead
,
Lian-Chang Zhao
Journal of Graph Theory
1984
Corpus ID: 206079228
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
1980
1980
Chromatic roots - some observations and conjectures
E. Farrell
Discrete Mathematics
1980
Corpus ID: 204985445
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE