8 citations · 23 across the 15 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
math.CO2022
Perfectly Matchable Set Polynomials and -polynomials for Stable Set Polytopes of Complements of Graphs
Robert Davis, Florian Kohl
A subset of vertices of a graph is called a perfectly matchable set of if the subgraph induced by contains a perfect matching. The perfectly matchable set polynomia…
math.CO2022★ 1 cited
Normalized Volumes of Type-PQ Adjacency Polytopes for Certain Classes of Graphs
Robert Davis, Joakim Jakovleski, Qizhe Pan
The type-PQ adjacency polytope associated to a simple graph is a -polytope containing valuable information about an underlying power network. Chen and the first author have re…