AbstractA new class of graph polynomials is defined. Tight bounds on the coefficients of the polynomials are given, and the exact polynomials for several classes of graphs are derived. The relationship of these polynomials to chromatic polynomials and graph coloring is discussed
AbstractHere quadratic and cubic σ-polynomials are characterized, or, equivalently, chromatic polyno...
AbstractWe investigate the chromatic polynomial χ(G, λ) of an unlabeled graph G. It is shown that χ(...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractA new class of graph polynomials is defined. Tight bounds on the coefficients of the polynom...
In this paper we observe the problem of counting graph colorings using polynomials. Several reformul...
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
A thesis submitted in fulfilment of the requirements for the degree of Master of Science, 2018In thi...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
Graph polynomials are polynomials associated to graphs that encode the number of subgraphs with give...
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in...
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
AbstractHere quadratic and cubic σ-polynomials are characterized, or, equivalently, chromatic polyno...
AbstractWe investigate the chromatic polynomial χ(G, λ) of an unlabeled graph G. It is shown that χ(...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractA new class of graph polynomials is defined. Tight bounds on the coefficients of the polynom...
In this paper we observe the problem of counting graph colorings using polynomials. Several reformul...
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of...
AbstractIn this paper, we describe some unsolved problems on chromatic polynomials along with a brie...
AbstractIn this paper, using the properties of chromatic polynomial and adjoint polynomial, we chara...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
A thesis submitted in fulfilment of the requirements for the degree of Master of Science, 2018In thi...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
Graph polynomials are polynomials associated to graphs that encode the number of subgraphs with give...
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in...
summary:We introduce a new concept namely the degree polynomial for the vertices of a simple graph. ...
AbstractHere quadratic and cubic σ-polynomials are characterized, or, equivalently, chromatic polyno...
AbstractWe investigate the chromatic polynomial χ(G, λ) of an unlabeled graph G. It is shown that χ(...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
DOI
Add to ORKG