1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2017
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…
math.CO2010★ 1 cited
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…