Now showing items 1-2 of 2
Efficient Computation of Chromatic and Flow Polynomials
This thesis surveys chromatic and flow polynomials, and presents new efficient methods to compute these polynomials on specific families of graphs. The chromatic and flow polynomials of a graph count the number of ways to ...
Graph Coloring, Zero Forcing, and Related Problems
This thesis investigates several problems related to classical and dynamic coloring of graphs, and enumeration of graph attributes. In the first part of the thesis, I present new efficient methods to compute the chromatic ...