We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
CONFLICT-FREE CONNECTIONS OF GRAPHS.
- Authors
CZAP, JÚLIUS; JENDROĽ, STANISLAV; VALISKA, JURAJ
- Abstract
An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. In this paper the question for the smallest number of colors needed for a coloring of edges of G in order to make it conflict-free connected is investigated. We show that the answer is easy for 2-edge-connected graphs and very difficult for other connected graphs, including trees.
- Subjects
GRAPH coloring; PATHS &; cycles in graph theory; GRAPH connectivity; TREE graphs; MATHEMATICAL analysis
- Publication
Discussiones Mathematicae: Graph Theory, 2018, Vol 38, Issue 4, p911
- ISSN
1234-3099
- Publication type
Article
- DOI
10.7151/dmgt.2036