We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. This is a generalization of the Q-chromatic function Zaslavsky introduced for gain graphs. Given a group G acting on a graph G and a G-set X, a proper X-coloring is a function with no monochromatic edge orbit. The set of proper colorings is a G-set which induces a polynomial function from the Burnside ring of G to itself. In this paper, we study many properties of the Burnside chromatic polynomial, answering some questions of Zaslavsk
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
Thesis (Ph.D.)--University of Washington, 2016-06This thesis demonstrates a connection between forma...
Given a group G of automorphisms of a graph Γ, the orbital chromatic polynomial OPΓ,G(x) is the poly...
We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. Th...
Abstract. A gain graph is a graph whose edges are labelled invertibly by gains from a group. A weak ...
31 pagesInternational audienceA gain graph is a graph whose edges are labelled invertibly by gains f...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
We study colorings and orientations of graphs in two related contexts. Firstly, we generalize Stanle...
Abstract. A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain ...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is...
AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bra...
AbstractA new class of graph polynomials is defined. Tight bounds on the coefficients of the polynom...
AbstractWe outline an approach to enumeration problems which relies on the algebra of free abelian g...
Motivated by the work of Chmutov, Duzhin and Lando on Vassiliev invariants, we define a polynomial o...
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
Thesis (Ph.D.)--University of Washington, 2016-06This thesis demonstrates a connection between forma...
Given a group G of automorphisms of a graph Γ, the orbital chromatic polynomial OPΓ,G(x) is the poly...
We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. Th...
Abstract. A gain graph is a graph whose edges are labelled invertibly by gains from a group. A weak ...
31 pagesInternational audienceA gain graph is a graph whose edges are labelled invertibly by gains f...
The chromatic polynomial P (G; k) is the function which gives the number of ways of colouring a grap...
We study colorings and orientations of graphs in two related contexts. Firstly, we generalize Stanle...
Abstract. A gain graph is a graph whose edges are orientably labelled from a group. A weighted gain ...
AbstractThe value Px(q) at an integer q ⩾1 of the chromatic polynomial of a finite graph X is the nu...
The chromatic polynomial of a graph, is a polynomial that when evaluated at a positive integer k, is...
AbstractAn explicit formula for the chromatic polynomials of certain families of graphs, called `bra...
AbstractA new class of graph polynomials is defined. Tight bounds on the coefficients of the polynom...
AbstractWe outline an approach to enumeration problems which relies on the algebra of free abelian g...
Motivated by the work of Chmutov, Duzhin and Lando on Vassiliev invariants, we define a polynomial o...
AbstractIn this paper, we introduce and study an extension of the chromatic polynomial of a graph. T...
Thesis (Ph.D.)--University of Washington, 2016-06This thesis demonstrates a connection between forma...
Given a group G of automorphisms of a graph Γ, the orbital chromatic polynomial OPΓ,G(x) is the poly...