Conflict-free vertex-connections of graphs (Q2282464): Difference between revisions

The authors consider the problem of conflict-free vertex-connected coloring of graphs and some related models. Among others, some very nice bounds on the parameter of the conflict-free vertex-connection number in the term of other graph parameter, as diameter, radius, etc., is given. The authors pose some interesting open questions that I believe will be inspiration to others to continue the research.