A graph consists of a set of vertices and a set of edges. A coloring of a graph is an assigning of colors to the vertices such that any adjacent vertices receive different colors. In particular, a coloring is called complete if every pair of colors appear on some edge. In this talk, we expand complete colorings of graphs to those of graphs embedded on surfaces and consider such colorings of even triangulations on the sphere
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
Abstract: The achromatic number χa (G) of a graph is the greatest number of color in a vertex colori...
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...
A graph consists of a set of vertices and a set of edges. A coloring of a graph is an assigning of c...
A (not necessarily proper) $k$-coloring $c : V(G) \rightarrow \{1,2,\dots,k\}$ of a graph $G$ on a s...
A (not necessarily proper) k-coloring c : V(G) → {1,2,…k} of a graph G on a surface is a facial t-co...
AbstractGiven an orientable or nonorientable closed surface S and an integer n not less than 3 and n...
The achromatic number of a graph ＄G＄ is the maximum number ＄k＄ such that ＄G＄ has a k-coloring each p...
Recently, Homann and Kriegel proved an important combinatorial theorem [4]: Every 2-connected bipar...
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...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like ...
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
Abstract: The achromatic number χa (G) of a graph is the greatest number of color in a vertex colori...
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...
A graph consists of a set of vertices and a set of edges. A coloring of a graph is an assigning of c...
A (not necessarily proper) $k$-coloring $c : V(G) \rightarrow \{1,2,\dots,k\}$ of a graph $G$ on a s...
A (not necessarily proper) k-coloring c : V(G) → {1,2,…k} of a graph G on a surface is a facial t-co...
AbstractGiven an orientable or nonorientable closed surface S and an integer n not less than 3 and n...
The achromatic number of a graph ＄G＄ is the maximum number ＄k＄ such that ＄G＄ has a k-coloring each p...
Recently, Homann and Kriegel proved an important combinatorial theorem [4]: Every 2-connected bipar...
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...
AbstractA triangulation is said to be even if each vertex has even degree. It is known that every ev...
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like ...
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has develo...
This paper studies the tricolorations of edges of triangulations of simply connected orientable surf...
Abstract: The achromatic number χa (G) of a graph is the greatest number of color in a vertex colori...
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...
Add to ORKG