Asset Details
Do you wish to reserve the book?
Upper Boundsand Extreme Results for Conflict-free Vertexconnection Number
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Upper Boundsand Extreme Results for Conflict-free Vertexconnection Number
Do you wish to request the book?
Upper Boundsand Extreme Results for Conflict-free Vertexconnection Number
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Upper Boundsand Extreme Results for Conflict-free Vertexconnection Number
2021
Overview
A path of a vertex-colored graph is conflict-free path, if there exists a color used only on one of its vertices; a vertex-colored graph is conflict-free vertex-connected, if there is a conflict-free path between each pair of distinct vertices of the graph. For a connected graph G, the minimum number of colors required to make G conflict-free vertex-connected is conflict-free vertex- connection number of G, denoted by vcfc(G). In this paper, we first showed an upper bound of vcfc(G) for the general graph by structural method. And then, we gave a partial solution to the conjecture on the conflict-free vertex-connection number by contradiction, posed by Doan and Schiermeyer in [Conflict-free vertex connection number at most 3 and size of graphs, Discus. Math. Graph Theory].
Publisher
IOP Publishing
Subject
We currently cannot retrieve any items related to this title. Kindly check back at a later time.