1 citations · 2 across the 4 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
A set of chromatic roots which is dense in the complex plane and closed under multiplication by positive integers
Adam Bohn
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…
math.CO2011
Chromatic polynomials of complements of bipartite graphs
Adam Bohn
Bicliques are complements of bipartite graphs; as such each consists of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomia…