Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,110,155 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.
2017
2017
Research on medical applications of contrast sensitivity function to red-green gratings in 3D space
Yun Liu
,
Jiachen Yang
,
Yancong Lin
,
Haibin Lv
Neurocomputing
2017
Corpus ID: 28377460
2017
2017
Polarization-Maintaining Supermode Fiber Supporting 20 Modes
H. Xiao
,
Haisu Li
,
+5 authors
S. Jian
IEEE Photonics Technology Letters
2017
Corpus ID: 25873852
We propose a novel polarization-maintaining supermode fiber containing quasi-elliptically arranged high-index cores. Numerical…
Expand
2012
2012
3D measurement system on the basis of a tailored free-form mirror
S. Zwick
,
S. Heist
,
Yannick Franzl
,
R. Steinkopf
,
P. Kühmstedt
,
G. Notni
Other Conferences
2012
Corpus ID: 120594711
Phase-shifting fringe projection is an effective method for 3D-shape measurements. Conventional fringe projection systems utilize…
Expand
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
1998
1998
Some families of chromatically unique bipartite graphs
Xiebin Chen
Discrete Mathematics
1998
Corpus ID: 33056781
1996
1996
Chromatic polynomials and σ-polynomials
C. Wakelin
Journal of Graph Theory
1996
Corpus ID: 19772559
In this paper we present some results on the sequence of coefficients of the chromatic polynomial of a graph relative to the…
Expand
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
1990
1990
Two classes of chromatically unique graphs
K. Koh
,
B. Goh
Discrete Mathematics
1990
Corpus ID: 45503158
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
1982
1982
The Subposet Lattice and the Order Polynomial
Paul H. Edelman
,
Paul Klingsberg
European journal of combinatorics (Print)
1982
Corpus ID: 8897061
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