AbstractThere are several polynomials used in the study of combinatorics including Birkhoff's chromatic polynomial for graphs, Stanley's order polynomial for partially ordered sets, and Tutte's dichromatic polynomial for graphs. We develop a common basis for these polynomials which depends on a sequence of standard reference objects in the category under consideration, the sequence being called a chromatic complex. The values of the polynomial then indicate the number of morphisms in the category from the object in question to the objects in the chromatic complex
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in...
AbstractA new concept of circulant chromatic function of a graph is introduced to generalize the con...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
In this paper we give first a new combinatorial interpretation of the coefficients of chromatic poly...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, th...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, the...
AbstractThis expository paper is a general introduction to the theory of chromatic polynomials. Chro...
Although these bounding conditions do not allow us to completely predict all chromatic polynomials, ...
AbstractThis paper is a survey of results on chromatic polynomials of graphs which are generalizatio...
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of...
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in...
AbstractA new concept of circulant chromatic function of a graph is introduced to generalize the con...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
In this paper we give first a new combinatorial interpretation of the coefficients of chromatic poly...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, th...
We present a two-variable polynomial, which simultaneously generalizes the chromatic polynomial, the...
AbstractThis expository paper is a general introduction to the theory of chromatic polynomials. Chro...
Although these bounding conditions do not allow us to completely predict all chromatic polynomials, ...
AbstractThis paper is a survey of results on chromatic polynomials of graphs which are generalizatio...
Chromatic polynomials of graphs have been studied extensively for around one century. The concept of...
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in...
AbstractA new concept of circulant chromatic function of a graph is introduced to generalize the con...