Add to ORKGIn this paper we observe the problem of counting graph colorings using polynomials. Several reformulations of The Four Color Conjecture are considered (among them algebraic, probabilistic and arithmetic). In the last section Tutte polynomials are mentioned. 1
PolygonsA graph coloring assigns colors to the vertices of a graph in such a way that a pair of vert...
AbstractWe consider the large size limit of the number of q-colourings for three types of planar gra...
AbstractTo count over some oriented graphs a class of combinatorial numbers is introduced. Their exp...
Graph polynomials are polynomials associated to graphs that encode the number of subgraphs with give...
AbstractA new class of graph polynomials is defined. Tight bounds on the coefficients of the polynom...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edg...
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edg...
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edg...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
The n-antiprism graph is not widely studied as a class of graphs in graph theory hence there is not...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
We propose two conjectures on the chromatic polynomial of a graph and show their validity for severa...
AbstractWe introduce the notions of arithmetic colorings and arithmetic flows over a graph with labe...
PolygonsA graph coloring assigns colors to the vertices of a graph in such a way that a pair of vert...
PolygonsA graph coloring assigns colors to the vertices of a graph in such a way that a pair of vert...
AbstractWe consider the large size limit of the number of q-colourings for three types of planar gra...
AbstractTo count over some oriented graphs a class of combinatorial numbers is introduced. Their exp...
Graph polynomials are polynomials associated to graphs that encode the number of subgraphs with give...
AbstractA new class of graph polynomials is defined. Tight bounds on the coefficients of the polynom...
Graph polynomials are uniformly defined families of graph invariants which are polynomials in some p...
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edg...
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edg...
We introduce the notions of arithmetic colorings and arithmetic flows over a graph with labelled edg...
AbstractThe chromatic polynomial (or chromial) of a graph was first defined by Birkhoff in 1912, and...
The n-antiprism graph is not widely studied as a class of graphs in graph theory hence there is not...
AbstractA study is made of the combinatorial properties of the dichromatic polynomials of graphs, es...
We propose two conjectures on the chromatic polynomial of a graph and show their validity for severa...
AbstractWe introduce the notions of arithmetic colorings and arithmetic flows over a graph with labe...
PolygonsA graph coloring assigns colors to the vertices of a graph in such a way that a pair of vert...
PolygonsA graph coloring assigns colors to the vertices of a graph in such a way that a pair of vert...
AbstractWe consider the large size limit of the number of q-colourings for three types of planar gra...
AbstractTo count over some oriented graphs a class of combinatorial numbers is introduced. Their exp...