collaborators

1 paper

math.CO2025

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…