1 citations · 2 across the 4 of their papers we have counts for
5 papers
Enumeration of -level polytopes
Adam Bohn, Yuri Faenza, Samuel Fiorini +3
A (convex) polytope is said to be -level if for every direction of hyperplanes which is facet-defining for , the vertices of can be covered with two hyperplanes of th…
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…
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…
Chromatic polynomials of complementary (n,k)-clique pairs
Adam Bohn
We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set…
Galois groups of multivariate Tutte polynomials
Adam Bohn, Peter J. Cameron, Peter Müller
The multivariate Tutte polynomial of a matroid is a generalization of the standard two-variable version, obtained by assigning a separate variable to each elem…