Results 91 to 100 of about 7,067 (209)
A Note on a Broken-Cycle Theorem for Hypergraphs
Whitney’s Broken-cycle Theorem states the chromatic polynomial of a graph as a sum over special edge subsets.
Trinks Martin
doaj +1 more source
Tutte's first colour-cycle conjecture
Includes bibliographical references.This thesis presents a proof of Conjecture I (see Section 35) of W. T. Tutte's paper "A contribution to the theory of chromatic polynomials''.
Kilpatrick, Peter Allan
core
Complexity of Join and Corona graphs and Chebyshev polynomials
Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj +1 more source
CATEGORIFICATION OF THE DICHROMATIC POLYNOMIAL FOR GRAPHS [PDF]
For each graph and each positive integer n, we define a chain complex whose graded Euler characteristic is equal to an appropriate n-specialization of the dichromatic polynomial. This also gives a categorification of n-specializations of the Tutte polynomial of graphs.
openaire +2 more sources
P-Generating Polynomials and the P-Fractal of a Graph
We define the P -generating polynomial for a graph G and property P as the generating polynomial for the number of P-subgraphs of G of each size. This polynomial is a generalization of the independence polynomial and so results for the independence ...
Cameron, Ben
core
The Interlace Polynomial of Graphs at − 1
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Balister +3 more
openaire +2 more sources
Algebraic Properties of Chromatic Polynomials and Their Roots
In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We relate algebraic properties of chromatic polynomials of graphs to structural properties of those graphs for some simple families of graphs.
Gilmore, Hamish Julian
core
Graphs and graph polynomials [PDF]
A dissertation submitted to the School of Mathematics in fulfilment of the requirements for the degree of Master of Science School of Mathematics University of the Witwatersrand, October 2017In this work we study the k-defect polynomials of a graph G. The
Kriel, Christo
core
Comparative Theory for Graph Polynomials (Dagstuhl Seminar 19401)
This report documents the programme and outcomes of Dagstuhl Seminar 19401 ``Comparative Theory for Graph Polynomials''. The study of graph polynomials has become increasingly active, with new applications and new graph polynomials being discovered ...
Ellis-Monaghan, Jo +3 more
core +1 more source
Polynomial Approximation and Graph-Coloring [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources

