Related papers: Strong convexity in flip-graphs
A periodic automorphism of a surface $\Sigma$ is said to be extendable over $S^3$ if it extends to a periodic automorphism of the pair $(S^3,\Sigma)$ for some possible embedding $\Sigma\to S^3$. We classify and construct all extendable…
The notion of graph cover, also known as locally bijective homomorphism, is a discretization of covering spaces known from general topology. It is a pair of incidence-preserving vertex- and edge-mappings between two graphs, the…
The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…
A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…
A tiling of the sphere by triangles, squares, or hexagons is convex if every vertex has at most 6, 4, or 3 polygons adjacent to it, respectively. Assigning an appropriate weight to any tiling, our main result is explicit formulas for the…
We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…
The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…
A simple graph G=(V,E) is 3-rigid if its generic bar-joint frameworks in R3 are infinitesimally rigid. Block and hole graphs are derived from triangulated spheres by the removal of edges and the addition of minimally rigid subgraphs, known…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
We investigate the problem of determining if a given graph corresponds to the dual of a triangulation of a simple polygon. This is a graph recognition problem, where in our particular case we wish to recognize a graph which corresponds to…
Motivated by the role of triadic closures in social networks, and the importance of finding a maximum subgraph avoiding a fixed pattern, we introduce and initiate the parameterized study of the Strong F-closure problem, where F is a fixed…
An automorphism $f$ of a closed orientable surface $\Sigma$ is said to be extendable over the 3-sphere $S^3$ if $f$ extends to an automorphism of the pair $(S^3, \Sigma)$ with respect to some embedding $\Sigma \hookrightarrow S^3$. We prove…
Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph $G$ has certain properties, then it has a homomorphism to a triangle-free graph $\Gamma$ of bounded size". For example, bounds on…
We study the graphene lattice with a curvature effect. The action depicting multilayers of graphene is portrayed in curved spacetime and effective Dirac equation scopes the curvature effect. The magnetic field is responsible for the…
Let $\Sigma$ be a $C^3$ compact symmetric convex hypersurface in $\mathbf{R}^{8}$. For some special cases, we prove that when $\Sigma$ carries exactly four geometrically distinct closed characteristics, then all of them must be symmetric.
For both triangulations of point sets and simple polygons, it is known that determining the flip distance between two triangulations is an NP-hard problem. To gain more insight into flips of triangulations and to characterize "where edges…
A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$ of vertices of $G$ is {\it weakly toll convex} if for any two non-adjacent…
Plane perfect matchings of $2n$ points in convex position are in bijection with triangulations of convex polygons of size $n+2$. Edge flips are a classic operation to perform local changes both structures have in common. In this work, we…
Let $\Sigma$ be a surface with boundary $b(\Sigma)$, $\mathcal{L}$ be a collection of $k$ disjoint $b(\Sigma)$-paths in $\Sigma$, and $P$ be a non-separating $b(\Sigma)$-path in $\Sigma$. We prove that there is a homeomorphism $\phi: \Sigma…
An old conjecture of Zs. Tuza says that for any graph $G$, the ratio of the minimum size, $\tau_3(G)$, of a set of edges meeting all triangles to the maximum size, $\nu_3(G)$, of an edge-disjoint triangle packing is at most 2. Here,…