A Grunbaum coloring of a triangulation G is a map c : E(G){1,2,3} such that for each face f of G, the three edges of the boundary walk of f are colored by three distinct colors. By Four Color Theorem, it is known that every triangulation on the sphere has a Grunbaum coloring. So, in this article, we investigate the question whether each even (i.e.,Eulerian) triangulation on a surface with representativity at least r has a Grunbaum coloring. We prove that, regardless of the representativity, every even triangulation on a surface F has a Grunbaum coloring as long as F is the projective plane, the torus, or the Klein bottle, and we observe that the same holds for any surface with sufficiently large representativity. On the other hand, we const...
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short const...
AbstractGiven an orientable or nonorientable closed surface S and an integer n not less than 3 and n...
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like ...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
(eng) This paper studies the tricolorations of edges of triangulations of simply connected orientabl...
This thesis consists of two parts. In the first part, we give a simple geometric description of the ...
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
AbstractWe show that for every orientable surface Σ there is a number c so that every Eulerian trian...
AbstractWe show that for every orientable surface Σ there is a number c so that every Eulerian trian...
A graph consists of a set of vertices and a set of edges. A coloring of a graph is an assigning of c...
A graph consists of a set of vertices and a set of edges. A coloring of a graph is an assigning of c...
We prove that if G is a triangulation of the torus and χ(G) 6 ≠ 5, then there is a 3-coloring of the...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
Recently, Homann and Kriegel proved an important combinatorial theorem [4]: Every 2-connected bipar...
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short const...
AbstractGiven an orientable or nonorientable closed surface S and an integer n not less than 3 and n...
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like ...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
(eng) This paper studies the tricolorations of edges of triangulations of simply connected orientabl...
This thesis consists of two parts. In the first part, we give a simple geometric description of the ...
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
AbstractWe show that for every orientable surface Σ there is a number c so that every Eulerian trian...
AbstractWe show that for every orientable surface Σ there is a number c so that every Eulerian trian...
A graph consists of a set of vertices and a set of edges. A coloring of a graph is an assigning of c...
A graph consists of a set of vertices and a set of edges. A coloring of a graph is an assigning of c...
We prove that if G is a triangulation of the torus and χ(G) 6 ≠ 5, then there is a 3-coloring of the...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
Recently, Homann and Kriegel proved an important combinatorial theorem [4]: Every 2-connected bipar...
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short const...
AbstractGiven an orientable or nonorientable closed surface S and an integer n not less than 3 and n...
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like ...