Furthermore, we show that the conflict-free connection number of the binomial tree with $$2^{k-1}$$ 2 k - 1 vertices is $$k-1$$ k - 1 . At last, we study trees which are $$ cfc $$ cfc -critical, and prove that if a tree T is $$ cfc $$ cfc -critical, then the ...
Gabow, H.N., Maheshwari, S.N., Osterweil, L.J.: On two problems in the generation of program test paths. IEEE Trans. Softw. Eng. 2(3), 227–231 (1976) MathSciNet Google Scholar Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Comb....
Conflict-free connection of treesdoi:10.1007/S10878-018-0363-XHong ChangMeng JiXueliang LiJingshu ZhangSpringer US
The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the minimum number of colors that are required in order to make G conflict-free connected. In this paper, we firstly determine all trees T of order n for which cfc(T) = n - t, where t ...