Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants complex, referred to as the pants graph, each isomorphic to the product of two Farey graphs. We deduce the existence of many convex planes in the pants graph of any surface of complexity at least 3
A pants decomposition of a compact orientable surface M is a set of disjoint simple cycles which cut...
We present a computational framework to optimize the pants decomposition of surfaces with non-trivia...
We present a computational framework to optimize the pants decomposition of surfaces with non-trivia...
Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants com...
ABSTRACT. We show that for a surface Σ, the subgraph of the pants graph determined by fixing a colle...
We prove a number of convexity results for strata of the diagonal pants graph of a surface, in analo...
Abstract. We prove a number of convexity results for strata of the diagonal pants graph of a surface...
Abstract. We prove a number of convexity results for strata of the diagonal pants graph of a sur-fac...
In recent work of Brock's, the pants graph is shown to be a combinatorial model for the completion o...
International audienceA lamination of a graph embedded on a surface is a collection of pairwise disj...
A pants decomposition of an orientable surface ?? is a collection of simple cycles that partition ??...
AbstractWe study the synthetic geometry of the pants graph of the 5-holed sphere, establishing the e...
In this dissertation we present complexity results related to the hull number and the convexity numb...
AbstractThe usual distance between pairs of vertices in a graph naturally gives rise to the notion o...
In a convex drawing of a plane graph G, every facial cycle of G is drawn as a convex polygon. A poly...
A pants decomposition of a compact orientable surface M is a set of disjoint simple cycles which cut...
We present a computational framework to optimize the pants decomposition of surfaces with non-trivia...
We present a computational framework to optimize the pants decomposition of surfaces with non-trivia...
Our main theorem identifies a class of totally geodesic subgraphs of the 1-skeleton of the pants com...
ABSTRACT. We show that for a surface Σ, the subgraph of the pants graph determined by fixing a colle...
We prove a number of convexity results for strata of the diagonal pants graph of a surface, in analo...
Abstract. We prove a number of convexity results for strata of the diagonal pants graph of a surface...
Abstract. We prove a number of convexity results for strata of the diagonal pants graph of a sur-fac...
In recent work of Brock's, the pants graph is shown to be a combinatorial model for the completion o...
International audienceA lamination of a graph embedded on a surface is a collection of pairwise disj...
A pants decomposition of an orientable surface ?? is a collection of simple cycles that partition ??...
AbstractWe study the synthetic geometry of the pants graph of the 5-holed sphere, establishing the e...
In this dissertation we present complexity results related to the hull number and the convexity numb...
AbstractThe usual distance between pairs of vertices in a graph naturally gives rise to the notion o...
In a convex drawing of a plane graph G, every facial cycle of G is drawn as a convex polygon. A poly...
A pants decomposition of a compact orientable surface M is a set of disjoint simple cycles which cut...
We present a computational framework to optimize the pants decomposition of surfaces with non-trivia...
We present a computational framework to optimize the pants decomposition of surfaces with non-trivia...
DOI
Add to ORKG