Conjecture 3.(Proper vertex coloring, [3]) For all graph G of order

n, there are the X(G) numbers of Sv's, v ∈ V (G), with this 1-2-3-edge

labeling and vertex Coloring. Where X(G) is the number colors of the

vertices on the graph G.

Article Vertax-Coloring and Edge-Weighting of complete graphs [47]

More Mohammad Reza Farahani's questions See All
Similar questions and discussions