Add to ORKGWe prove that if G is a triangulation of the torus and χ(G) 6 ≠ 5, then there is a 3-coloring of the edges of G so that the edges bounding every face are assigned three different colors
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...
In 1973, Altshuler characterized the $6$-regular triangulations on the torus to be precisely those t...
We prove that if G is a triangulation of the torus and χ(G) 6 = 5, then there is a 3-coloring of the...
This thesis consists of two parts. In the first part, we give a simple geometric description of the ...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
A Grunbaum coloring of a triangulation G is a map c : E(G){1,2,3} such that for each face f of G, th...
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short const...
AbstractA simple proof of Grünbaum's theorem on the 3-colourability of planar graphs having at most ...
The Three Color Problem is: Under what conditions can the regions of a planar map be colored in thre...
AbstractA slight variation of a problem posed by P. Erdös asks: “Can the points on the unit sphere b...
The Three Color Problem is: Under what conditions can the regions of a planar map be colored in thre...
The theory of Dvořák et al. shows that a 4-critical triangle-free graph embedded in the torus has on...
(eng) This paper studies the tricolorations of edges of triangulations of simply connected orientabl...
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...
In 1973, Altshuler characterized the $6$-regular triangulations on the torus to be precisely those t...
We prove that if G is a triangulation of the torus and χ(G) 6 = 5, then there is a 3-coloring of the...
This thesis consists of two parts. In the first part, we give a simple geometric description of the ...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
AbstractWe prove that every graph on the torus without triangles or quadrilaterals is 3-colorable. T...
A Grunbaum coloring of a triangulation G is a map c : E(G){1,2,3} such that for each face f of G, th...
Using the existence of noncrossing Eulerian circuits in Eulerian plane graphs, we give a short const...
AbstractA simple proof of Grünbaum's theorem on the 3-colourability of planar graphs having at most ...
The Three Color Problem is: Under what conditions can the regions of a planar map be colored in thre...
AbstractA slight variation of a problem posed by P. Erdös asks: “Can the points on the unit sphere b...
The Three Color Problem is: Under what conditions can the regions of a planar map be colored in thre...
The theory of Dvořák et al. shows that a 4-critical triangle-free graph embedded in the torus has on...
(eng) This paper studies the tricolorations of edges of triangulations of simply connected orientabl...
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...
In 1973, Altshuler characterized the $6$-regular triangulations on the torus to be precisely those t...