Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Total colourings of planar graphs with large girth
European Journal of Combinatorics
Vertex coloring with a distance restriction
Discrete Mathematics
Discrete Mathematics
Edge coloring of bipartite graphs with constraints
Theoretical Computer Science
Journal of Algorithms
A distributed strict strong coloring algorithm for broadcast applications in ad hoc networks
NOTERE '08 Proceedings of the 8th international conference on New technologies in distributed systems
A Generalized Graph Strict Strong Coloring Algorithm
International Journal of Applied Metaheuristic Computing
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
| Hi-index | 0.89 |
In this paper we introduce and study a new coloring parameter of a graph called the strict strong coloring (short SSColoring). A SSColoring of a graph G is a vertex proper coloring of G such that each vertex of G is adjacent to at least one not empty color class. The minimum number of colors among all SSColorings is called strict strong chromatic (short SSChromatic) number, denoted by @g"s"s(G). In this paper we prove the NP-completeness of the problem, we discuss the @g"s"s(G) number of trees by giving some bounds. Finally, we give an optimal polynomial algorithm for SSColoring of trees.