Related papers: Feedback game on $3$-chromatic Eulerian triangulat…
For integers $n\ge 0$, an iterated triangulation $Tr(n)$ is defined recursively as follows: $Tr(0)$ is the plane triangulation on three vertices and, for $n\ge 1$, $Tr(n)$ is the plane triangulation obtained from the plane triangulation…
In 1973, Fisk proved that any $4$-coloring of a $3$-colorable triangulation of the $2$-sphere can be obtained from any $3$-coloring by a sequence of Kempe-changes. On the other hand, in the case where we are only allowed to recolor a single…
Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise structural answer to this question. Essentially, we show that…
M\"uller games form a well-established class of games for model checking and verification. These games are played on directed graphs $\mathcal G$ where Player 0 and Player 1 play by generating an infinite path through the graph. The winner…
We introduce a new combinatorial game, named Triangle Game. In this game, a directed $3$-cycle graph is given, and tokens are placed on each vertex. The player chooses an edge and takes at least one token from the initial vertex. At the…
A graph $G$ is $(d_1,\ldots,d_k)$-colorable if its vertex set can be partitioned into $k$ sets $V_1,\ldots,V_k$, such that for each $i\in\{1, \ldots, k\}$, the subgraph of $G$ induced by $V_i$ has maximum degree at most $d_i$. The Four…
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree at least 4 and boundary vertices of degree at least 3 and (2)…
We study the chromatic number of the curve graph of a surface. We show that the chromatic number grows like k log k for the graph of separating curves on a surface of Euler characteristic -k. We also show that the graph of curves that…
In this paper we consider the equiform motion of a sphere in Euclidean space $\mathbf{E}^7$. We study and analyze the corresponding kinematic three dimensional surface under the hypothesis that its scalar curvature $\mathbf{K}$ is constant.…
We study those Lagrangian surfaces in complex Euclidean space which are foliated by circles or by straight lines. The former, which we call cyclic, come in three types, each one being described by means of, respectively, a planar curve, a…
We combine the ideas of edge coloring games and asymmetric graph coloring games and define the \emph{$(m,1)$-edge coloring game}, which is alternatively played by two players Maker and Breaker on a finite simple graph $G$ with a set of…
Every embedded surface $\mathcal{K}$ in the 4-sphere admits a bridge trisection, a decomposition of $(S^4,\mathcal{K})$ into three simple pieces. In this case, the surface $\mathcal{K}$ is determined by an embedded 1-complex, called the…
We study infinitesimal conformal deformations of a triangulated surface in Euclidean space and investigate the change in its extrinsic geometry. A deformation of vertices is conformal if it preserves length cross-ratios. On one hand,…
A proper edge coloring of a graph $G$ with colors $1,2,\dots,t$ is called a \emph{cyclic interval $t$-coloring} if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is…
We classify all surfaces with constant Gaussian curvature $K$ in Euclidean $3$-space that can be expressed as an implicit equation of type $f(x)+g(y)+h(z)=0$, where $f$, $g$ and $h$ are real functions of one variable. If $K=0$, we prove…
In this paper, we find all constant slope surfaces in the Euclidean 3-space, namely those surfaces for which the position vector of a point of the surface makes constant angle with the normal at the surface in that point. These surfaces…
Without further ado, we present the P_3-game. The P_3-game is decidable for elementary classes of graphs such as paths and cycles. From an algorithmic point of view, the connected P_3-game is fascinating. We show that the connected P_3-game…
We study rotational surfaces in Euclidean 3-space whose Gauss curvature is given as a prescribed function of its Gauss map. By means of a phase plane analysis and under mild assumptions on the prescribed function, we generalize the…
In this paper we consider the equiform motion of a helix in Euclidean space $\mathbf{E}^7$. We study and analyze the corresponding kinematic three dimensional surface under the hypothesis that its scalar curvature $\mathbf{K}$ is constant.…
The Cops and Robber game is played on undirected finite graphs. A number of cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if they can catch the robber. The minimum number of cops needed…