" This is the first book to comprehensively cover chromatic polynomials of graphs. It includes
most of the known results and unsolved problems in the area of chromatic polynomials …

A chromatic root is a root of the chromatic polynomial of a graph. Any chromatic root is an
algebraic integer. Much is known about the location of chromatic roots in the real and …

In this paper we describe a parallel algorithm for generating all nonisomorphic rank 3 simple
matroids with a given multiplicity vector. We apply our implementation in the high …

As widely regarded, one of the most classical and remarkable tools to measure the
asymptotic normality of combinatorial statistics is due to Harper's real-rooted method …

Graphs and Combinatorics Page 1 Digital Object Identifier (DOI) 10.1007/s00373-005-0617-0
Graphs and Combinatorics (2005) 21:319–323 Graphs and Combinatorics © Springer-Verlag …

A graph is a set of vertices and edges, that is, connections between pairs of vertices. Graphs
are a useful tool in abstracting the essential elements of a task in order to solve it. The first …

We study a very large family of graphs, the members of which comprise disjoint paths of
cliques with extremal cliques identified. This broad characterisation naturally generalises …

We show if the flow polynomial of a bridgeless graph G has only integral roots, then G is the
dual graph to a planar chordal graph. We also show that for 3-connected cubic graphs, the …