相关论文: Once punctured disks, non-convex polygons, and poi…

A convex geometric graph is a graph whose vertices are the corners of a convex polygon P in the plane and whose edges are boundary edges and diagonals of the polygon. It is called triangulation-free if its non-boundary edges do not contain…

A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

The symmetries of complex molecular structures can be modeled by the {\em topological symmetry group} of the underlying embedded graph. It is therefore important to understand which topological symmetry groups can be realized by particular…

We introduce the concept of twisted contact groupoids, as an extension either of contact groupoids or of twisted symplectic ones, and we discuss the integration of twisted Jacobi manifolds by twisted contact groupoids. We also investigate…

A graph associahedron is a polytope dual to a simplicial complex whose elements are induced connected subgraphs called tubes. Graph associahedra generalize permutahedra, associahedra, and cyclohedra, and therefore are of great interest to…

In this paper, all graphs are assumed to be finite. For $s\geq 1$ and a graph $\G$, if for every pair of isomorphic connected induced subgraphs on at most $s$ vertices there exists an automorphism of $\G$ mapping the first to the second,…

In this paper, we propose a new type of graph, denoted as "embedded-graph", and its theory, which employs a distributed representation to describe the relations on the graph edges. Embedded-graphs can express linguistic and complicated…

A class $\mathcal{G}$ of graphs is called hereditary if it is closed under taking induced subgraphs. We denote by $G^{epex}$ the class of graphs that are at most one edge away from being in $\mathcal{G}$. We note that $G^{epex}$ is…

A subcomplex $\mathcal{X}$ of a cell complex $\mathcal{C}$ is called \emph{rigid} with respect to another cell complex $\mathcal{C}'$ if every injective simplicial map $\lambda:\mathcal{X} \rightarrow \mathcal{C}'$ has a unique extension to…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

We are generalizing to higher dimensions the Bavard-Ghys construction of the hyperbolic metric on the space of polygons with fixed directions of edges. The space of convex d-dimensional polyhedra with fixed directions of facet normals has a…

In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are…

Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the…

We prove the connectedness and calculate the diameter of the oriented graph of graftings associated to exotic complex projective structures on a compact surface S with a given holonomy representation of Fuchsian type. The oriented graph of…

We study the problem of finding the minimal (maximal) genus for a surface where a given four-valent graph with fixed opposite edge structure can be embedded into. We find several partial relations and give new reformulations in…

We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…

A sequence $\sigma$ of $p$ non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a $3$-connected, planar graph. We investigate which sequences are unigraphic with…

We consider facet-Hamiltonian cycles of polytopes, defined as cycles in their skeleton such that every facet is visited exactly once. These cycles can be understood as optimal watchman routes that guard the facets of a polytope. We consider…

We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…