Conflict-free vertex-connections of graphs (Q2282464)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Conflict-free vertex-connections of graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Conflict-free vertex-connections of graphs |
scientific article |
Statements
Conflict-free vertex-connections of graphs (English)
0 references
8 January 2020
0 references
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.
0 references
vertex-coloring
0 references
conflict-free vertex connections
0 references
