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
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...
A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of c...
In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain l...
AbstractA vertex coloring of a plane graph is ℓ-facial if every two distinct vertices joined by a fa...
A vertex coloring of a plane graph is `-facial if every two distinct vertices joined by a facial wal...
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the bo...
AbstractIn an l-facial coloring, any two different vertices that lie on the same face and are at dis...
International audienceA vertex coloring of a plane graph is ℓ-facial if every two distinct vertices ...
International audienceA plane graph is l-facially k-colourable if its vertices can be coloured with ...
AbstractA facial parity edge colouring of a connected bridgeless plane graph is such an edge colouri...
A facial unique-maximum coloring of a plane graph is a proper vertex coloring by natural numbers whe...
International audienceA facial parity edge colouring of a connected bridgeless plane graph is an edg...
International audienceAn edge-face coloring of a plane graph with edge set E and face set F is a col...
A facial unique-maximum coloring of a plane graph is a proper coloring of the vertices using positiv...
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...
A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of c...
In this paper we introduce the concept of zig-zag facial total-coloring of plane graphs. We obtain l...
AbstractA vertex coloring of a plane graph is ℓ-facial if every two distinct vertices joined by a fa...
A vertex coloring of a plane graph is `-facial if every two distinct vertices joined by a facial wal...
Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the bo...
AbstractIn an l-facial coloring, any two different vertices that lie on the same face and are at dis...
International audienceA vertex coloring of a plane graph is ℓ-facial if every two distinct vertices ...
International audienceA plane graph is l-facially k-colourable if its vertices can be coloured with ...
AbstractA facial parity edge colouring of a connected bridgeless plane graph is such an edge colouri...
A facial unique-maximum coloring of a plane graph is a proper vertex coloring by natural numbers whe...
International audienceA facial parity edge colouring of a connected bridgeless plane graph is an edg...
International audienceAn edge-face coloring of a plane graph with edge set E and face set F is a col...
A facial unique-maximum coloring of a plane graph is a proper coloring of the vertices using positiv...
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...
A proper colouring of a plane graph G is called facially homogeneous if it uses the same number of c...