Conflict-Free Connections of Graphs
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...
में बचाया:
| मुख्य लेखकों: | , , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
University of Zielona Góra
2018-11-01
|
| श्रृंखला: | Discussiones Mathematicae Graph Theory |
| विषय: | |
| ऑनलाइन पहुंच: | https://doi.org/10.7151/dmgt.2036 |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|