Results 191 to 200 of about 568,566 (214)

An introduction to chromatic polynomials

Journal of Combinatorial Theory, 1968
This expository paper is a general introduction to the theory of chromatic polynomials. Chromatic polynomials are defined, their salient properties are derived, and some practical methods for computing them are given.
Read, Ronald C.
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On the chromatic polynomial of a graph

Mathematical Programming, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
AVIS D., DE SIMONE C., NOBILI, Paolo
openaire   +5 more sources

Cutpoints and the chromatic polynomial

Journal of Graph Theory, 1984
AbstractWe prove that the multiplicity of the root 1 in the chromatic polynomial of a simple graph G is equal to the number of nontrivial blocks in G. In particular, a connected simple graph G has a cutpoint if and only if its chromatic polynomial is divisible by (λ – 1)2.
Earl Glen Whitehead Jr., Lian-Chang Zhao
openaire   +2 more sources

Extended Chromatic Polynomials

Canadian Journal of Mathematics, 1972
Let G be a finite graph with non-empty vertex set (G) and edge set (G) (see [2]). Let λ be a positive integer. Tutte [5] defines a λ-colouring of G as a mapping of (G) into the set Iλ = {1, 2, 3, …, λ} with the property that two ends of any edge are mapped onto distinct integers.
Sobczyk, Andrew, Gettys, James O. jun.
openaire   +1 more source

Chromatic Polynomials of Complements of Bipartite Graphs

Graphs Comb., 2011
We define a biclique to be the complement of a bipartite graph, consisting of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomials of these graphs. We derive a formula for the chromatic polynomial
A. Bohn
semanticscholar   +1 more source

On injective chromatic polynomials of graphs

Discrete Mathematics, Algorithms and Applications, 2015
The injective chromatic number χi(G) [G. Hahn, J. Kratochvil, J. Siran and D. Sotteau, On the injective chromatic number of graphs, Discrete Math. 256(1–2) (2002) 179–192] of a graph G is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors.
Anjaly Kishore, M. S. Sunitha
openaire   +2 more sources

Chromatic polynomials and ?-polynomials

Journal of Graph Theory, 1996
openaire   +1 more source

Melting lollipop chromatic quasisymmetric functions and Schur expansion of unicellular LLT polynomials

Discrete Mathematics, 2020
Sun-Young Nam
exaly  

LLT polynomials, chromatic quasisymmetric functions and graphs with cycles

Discrete Mathematics, 2018
Per Alexandersson, Greta Panova
exaly  

CHROMATIC POLYNOMIALS OF SOME NANOSTARS

, 2012
S. Alikhani, M. Iranmanesh
semanticscholar   +1 more source