Conflict-Free Vertex-Connections of Graphs

A path in a vertex-colored graph is called conflict-free if there is a color used on exactly one of its vertices. A vertex-colored graph is said to be conflict-free vertex-connected if any two vertices of the graph are connected by a conflict-free path. This paper investigates the question: for a co...

Full description

Bibliographic Details
Main Authors: Li Xueliang, Zhang Yingying, Zhu Xiaoyu, Mao Yaping, Zhao Haixing, Jendrol’ Stanislav
Format: Article
Language:English
Published: Sciendo 2020-02-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2116