Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

32 relations
Acyclic orientationAlgebraic graph theoryBranch and boundBull graph

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Total dominator chromatic number of k-subdivision of graphs
Let $G$ be a simple graph. A total dominator coloring of $G$, is a proper coloring of the vertices of $G$ in which each vertex of… 
2017
2017
More on the total dominator chromatic number of a graph
Abstract Let G be a simple graph. A total dominator coloring of G, is a proper coloring of the vertices of G in which each vertex… 
2017
2017
Polarization-Maintaining Supermode Fiber Supporting 20 Modes
We propose a novel polarization-maintaining supermode fiber containing quasi-elliptically arranged high-index cores. Numerical… 
Review
2010
Review
2010
CHROMATIC POLYNOMIALS OF SOME NANOTUBES
Let ) , ( λ χ G denotes the number of proper vertex colourings of with at most G λ colours. G. Birkhoff , observed in 1912 that… 
2008
2008
Bidirectional reconfigurable optical add-drop multiplexer with power compensation built-in optical amplifiers
A power-compensated bidirectional reconfigurable optical add-drop multiplexer (Bi-ROADM) based on tunable fiber Bragg gratings is… 
2006
2006
Color Features for Image Fingerprinting
Image fingerprinting systems aim to extract unique and robust image descriptors (in analogy to human fingerprints). They search… 
1998
1998
Some families of chromatically unique bipartite graphs
1996
1996
Chromatic polynomials and σ-polynomials
In this paper we present some results on the sequence of coefficients of the chromatic polynomial of a graph relative to the… 
1994
1994
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
Highly Cited
1984
Highly Cited
1984
Cutpoints and the chromatic polynomial
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… 
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)