Results 131 to 140 of about 2,394 (219)

Evaluating the rank generating function of a graphic 2-polymatroid

open access: yes, 2006
We consider the complexity of the two-variable rank generating function, $S$, of a graphic 2-polymatroid. For a graph $G$, $S$ is the generating function for the number of subsets of edges of $G$ having a particular size and incident with a particular ...
Noble, SD, Noble, Steven
core   +1 more source

A new two-variable generalization of the chromatic polynomial for signed graphs

open access: yes, 2011
The function that counts the number of proper colorings of a graph is the chromatic\ud polynomial. Such colorings can also be done with signed graphs, graphs consisting\ud of an unsigned graph and a sign function labeling each edge and loop positive or ...
Hardin, Mela Maria
core   +1 more source

Finding the Chromatic Polynomial of Cayley Graphs using the Tutte Polynomial

open access: yes, 2007
No abstract available."Finding the Chromatic Polynomial of Cayley Graphs using the Tutte Polynomial." ARS Combinatoria. Vol.
Nancy Celniker
core  

Chromatic polynomials

open access: yes, 2023
This thesis studies the chromatic polynomial Z(G;q) and its generalizaton, the partition function Z(G;q,y) of the random cluster (RC) model. The main questions concern the location of the zeros of the chromatic polynomial, and the algorithmic approximation of the RC partition function.Chapter 2 studies the chromatic zeros of series-parallel graphs and ...
openaire   +1 more source

A minimal-distance chromatic polynomial for signed graphs

open access: yes, 2012
In the early 20th century the chromatic polynomial was introduced as a way to count the proper colorings of a graph. It was generalized to signed graphs, graphs consisting of an unsigned graph and a signing function that labels each edge with a positive ...
Nicholas E. Dowdall
core  

Chromatic Bounds on Orbital Chromatic Roots

open access: yes, 2013
Given a group G of automorphisms of a graph Γ, the orbital chromatic polynomial OPΓ,G(x) is the polynomial whose value at a positive integer k is the number of orbits of G on proper k-colorings of Γ. In \cite{Cameron}, Cameron et. al.
Omar, Mohamed   +2 more
core  

Home - About - Disclaimer - Privacy