AbstractGiven a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associahedra in a general context, for pseudographs with loops and multiple edges, which are also allowed to be disconnected. We then consider deformations of pseudograph associahedra as their underlying graphs are altered by edge contractions and edge deletions
Recently a generalization of simple convex polytopes to combinatorial entities known as ab-stract po...
AbstractGiven a graph Γ, we construct a simple, convex polytope, dubbed graph-associahedra, whose fa...
AbstractWe investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturm...
Abstract. Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset i...
AbstractGiven a simple graph G, the graph associahedron KG is a simple polytope whose face poset is ...
Abstract. Motivated by the graph associahedron KG, a polytope whose face poset is based on connected...
Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs...
Abstract. Given an arbitrary polygon P with holes, we construct a polytopal complex analogous to the...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...
Given an arbitrary simple polygon, we construct a polytopal complex analogous to the associahedron b...
Abstract. A graph associahedron is a simple polytope whose face lattice encodes the nested structure...
By using the algorithm given by Devados [1], we have been worked on the constructionof a graph assoc...
Given an arbitrary simple polygon, we construct a polytopal complex analogous to the associahedron b...
AbstractGiven any finite graph, we offer a simple realization of its corresponding graph associahedr...
Recently a generalization of simple convex polytopes to combinatorial entit ies known as ab-stract p...
Recently a generalization of simple convex polytopes to combinatorial entities known as ab-stract po...
AbstractGiven a graph Γ, we construct a simple, convex polytope, dubbed graph-associahedra, whose fa...
AbstractWe investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturm...
Abstract. Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset i...
AbstractGiven a simple graph G, the graph associahedron KG is a simple polytope whose face poset is ...
Abstract. Motivated by the graph associahedron KG, a polytope whose face poset is based on connected...
Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs...
Abstract. Given an arbitrary polygon P with holes, we construct a polytopal complex analogous to the...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...
Given an arbitrary simple polygon, we construct a polytopal complex analogous to the associahedron b...
Abstract. A graph associahedron is a simple polytope whose face lattice encodes the nested structure...
By using the algorithm given by Devados [1], we have been worked on the constructionof a graph assoc...
Given an arbitrary simple polygon, we construct a polytopal complex analogous to the associahedron b...
AbstractGiven any finite graph, we offer a simple realization of its corresponding graph associahedr...
Recently a generalization of simple convex polytopes to combinatorial entit ies known as ab-stract p...
Recently a generalization of simple convex polytopes to combinatorial entities known as ab-stract po...
AbstractGiven a graph Γ, we construct a simple, convex polytope, dubbed graph-associahedra, whose fa...
AbstractWe investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturm...
DOI
Add to ORKG