4 papers · 1 filter
A sufficient condition for planar graphs with maximum degree eight to be totally 9-colorable
Zakir Deniz, Hakan Guler
A total coloring of a graph is a coloring of the vertices and edges such that two adjacent or incident elements receive different colors. The minimum number of colors required…
A 2-distance -coloring of planar graphs
Zakir Deniz
A vertex coloring of a graph is called a -distance coloring if any two vertices at a distance at most from each other receive different colors. Recently, Bousquet et al.…
On 2-distance 16-coloring of planar graphs with maximum degree at most five
Zakir Deniz
A vertex coloring of a graph G is called a 2-distance coloring if any two vertices at a distance at most 2 from each other receive different colors. Suppose that G is a planar grap…
On 2-Distance ()-coloring of planar graphs with girth at least five
Zakir Deniz
A vertex coloring of a graph is called a 2-distance coloring if any two vertices at distance at most from each other receive different colors. Let be a planar graph wit…