DOIAbstract
AbstractIt is well known that chromatic polynomials can have roots (chromatic roots) of arbitrarily large modulus. We prove here that for any graph G and any ε>0, there is a subdivision of G all of whose chromatic roots lie in |z−1|<1+ε
AbstractIt is well known that chromatic polynomials can have roots (chromatic roots) of arbitrarily large modulus. We prove here that for any graph G and any ε>0, there is a subdivision of G all of whose chromatic roots lie in |z−1|<1+ε
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
AbstractGiven a graph G, we derive an expression for the chromatic polynomials of the graphs resulti...
AbstractIt is well known that chromatic polynomials can have roots (chromatic roots) of arbitrarily ...
AbstractIt is proved that the chromatic polynomial of a connected graph with n vertices and m edges ...
AbstractGiven a graph G, we derive an expression for the chromatic polynomials of the graphs resulti...
A chromatic root is a root of the chromatic polynomial of a graph.Any chromatic root is an algebraic...
A chromatic root is a root of the chromatic polynomial of a graph.Any chromatic root is an algebraic...
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
AbstractIt is proved that the chromatic polynomial of a connected graph with n vertices and m edges ...
In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We re...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
AbstractGiven a graph G, we derive an expression for the chromatic polynomials of the graphs resulti...
AbstractIt is well known that chromatic polynomials can have roots (chromatic roots) of arbitrarily ...
AbstractIt is proved that the chromatic polynomial of a connected graph with n vertices and m edges ...
AbstractGiven a graph G, we derive an expression for the chromatic polynomials of the graphs resulti...
A chromatic root is a root of the chromatic polynomial of a graph.Any chromatic root is an algebraic...
A chromatic root is a root of the chromatic polynomial of a graph.Any chromatic root is an algebraic...
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of...
A chromatic root is a zero of the chromatic polynomial of a graph. At a Newton Institute workshop on...
AbstractIt is proved that the chromatic polynomial of a connected graph with n vertices and m edges ...
In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We re...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
International audienceExtended Abstract The chromatic number χ(D) of a digraph D is the chromatic nu...
Add to ORKG