In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain lower and upper bounds for the minimum number of colors which is necessary for such a coloring. Moreover, we give several sharpness examples and formulate some open problems
We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and o...
AbstractWe prove new upper bounds on the Thue chromatic number of an arbitrary graph and on the faci...
We consider a vertex colouring of a connected plane graph G. A colour c is used k times by a face α ...
In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain l...
A vertex coloring of a plane graph is `-facial if every two distinct vertices joined by a facial wal...
AbstractA vertex coloring of a plane graph is ℓ-facial if every two distinct vertices joined by a fa...
A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of c...
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the bo...
A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected...
A facial rainbow edge-coloring of a plane graph G is an edge-coloring such that any two edges receiv...
AbstractThe edges and faces of a plane graph are colored so that every two adjacent or incident of t...
International audienceA sequence r1, r2, ..., r2n such that ri=rn+ i for all 1≤i≤n is called a repet...
AbstractIn an l-facial coloring, any two different vertices that lie on the same face and are at dis...
AbstractLet f(G) be the maximum number of colors in a vertex coloring of a simple plane graph G such...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and o...
AbstractWe prove new upper bounds on the Thue chromatic number of an arbitrary graph and on the faci...
We consider a vertex colouring of a connected plane graph G. A colour c is used k times by a face α ...
In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain l...
A vertex coloring of a plane graph is `-facial if every two distinct vertices joined by a facial wal...
AbstractA vertex coloring of a plane graph is ℓ-facial if every two distinct vertices joined by a fa...
A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of c...
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the bo...
A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected...
A facial rainbow edge-coloring of a plane graph G is an edge-coloring such that any two edges receiv...
AbstractThe edges and faces of a plane graph are colored so that every two adjacent or incident of t...
International audienceA sequence r1, r2, ..., r2n such that ri=rn+ i for all 1≤i≤n is called a repet...
AbstractIn an l-facial coloring, any two different vertices that lie on the same face and are at dis...
AbstractLet f(G) be the maximum number of colors in a vertex coloring of a simple plane graph G such...
A total coloring of a graph G is an assignment of colors to the elements of the graph G such that no...
We prove that the facial nonrepetitive chromatic number of any outerplanar graph is at most 11 and o...
AbstractWe prove new upper bounds on the Thue chromatic number of an arbitrary graph and on the faci...
We consider a vertex colouring of a connected plane graph G. A colour c is used k times by a face α ...
DOI
Add to ORKG