Related papers: Feedback game on $3$-chromatic Eulerian triangulat…
Chromogeometry brings together Euclidean geometry (called blue) and two relativistic geometries (called red and green), in a surprising three-fold symmetry. We show how the red and green `Euler lines' and `nine-point circles' of a triangle…
The main contributions of this paper are three-fold. First, we use a dynamic approach based on Reiter's pioneering work on Karp-Miller computation graphs to give a new and short proof of Mohar's Minty-type Theorem. Second, we bridge…
We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…
The good mesh quality of an evolving discretized surface or domain is often compromised during time evolution. In recent years this phenomena have been overcome in a couple of ways, one of them uses arbitrary Lagrangian Eulerian maps.…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
It is well known that a three dimensional (closed, connected and compact) manifold is obtained by identifying boundary faces from a polyhedron P. The study of (\partial P)/~, the boundary \partial P with the polygonal faces identified in…
The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing…
Total variant of well known graph coloring game is considered. We determine exact values of total game chromatic number for some classes of graphs and show show the strategie for first player to win the game. We also show relation between…
We introduce an Eulerian approach for problems involving one or more soft solids immersed in a fluid, which permits mechanical interactions between all phases. The reference map variable is exploited to simulate finite-deformation…
The graph coloring game is a famous two-player game (re)introduced by Bodlaender in $1991$. Given a graph $G$ and $k \in \mathbb{N}$, Alice and Bob alternately (starting with Alice) color an uncolored vertex with some color in…
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal…
We initiate the study of chromatic numbers for contact graphs of configurations of integer-sized cuboids in three dimensions, all of which are mutually congruent. Disallowing rotations, we show a global upper bound of 8 for the chromatic…
The Cyclic Coloring Conjecture asserts that the vertices of every plane graph with maximum face size D can be colored using at most 3D/2 colors in such a way that no face is incident with two vertices of the same color. The Cyclic Coloring…
A method is suggested for construction of quadrangulations of the closed orientable surface with given genus g and either (1) with given chromatic number or (2) with given order allowed by the genus g. In particular, N. Hartsfield and G.…
We study the reflectional symmetry of a surface in the Euclidean 3-dimensional space with a cross-cap singularity with respect to planes. This symmetry is picked up by the singularities of folding maps on the cross-cap. We give a list of…
Graph colorings is a fundamental topic in graph theory that require an assignment of labels (or colors) to vertices or edges subject to various constraints. We focus on the harmonious coloring of a graph, which is a proper vertex coloring…
Domineering is a combinatorial game played on a subset of a rectangular grid between two players. Each board position can be put into one of four outcome classes based on who the winner will be if both players play optimally. In this note,…
Boolean operations of geometric models is an essential issue in computational geometry. In this paper, we develop a simple and robust approach to perform Boolean operations on closed and open triangulated surfaces. Our method mainly has two…
This paper deals with a kind of design of a ruled surface. It combines concepts from the fields of computer aided geometric design and kinematics. A dual unit spherical B\'ezier-like curve on the dual unit sphere (DUS) is obtained with…
In this paper, we give a polynomial time algorithm which determines if a given triangle-free graph with no induced seven-vertex path is 3-colorable, and gives an explicit coloring if one exists.