Bond polytopes of 1- and 2-sums of graphs can be built from those of the summands, giving linear extension complexity for (K5 minus e)-minor-free graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Bond Polytope under Vertex- and Edge-sums
Bond polytopes of 1- and 2-sums of graphs can be built from those of the summands, giving linear extension complexity for (K5 minus e)-minor-free graphs.