Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #20 Nov 30 2023 07:19:25
%S 4,5,5,6,6,6,7,7,7,7,8,8,8,8,8,9,9,9,9,9,9,10,10,10,10,10,10,10,11,11,
%T 11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,
%U 13,13,14,14,14,14,14,14,14,14,14,14,14,15,15,15,15,15
%N 2-tone chromatic number of a tree with maximum degree n.
%C The 2-tone chromatic number of a graph G is the smallest number of colors for which G has a coloring where every vertex has two distinct colors, no adjacent vertices have a common color, and no pair of vertices at distance 2 have two common colors.
%C a(n) is also the 2-tone chromatic number of a star with n leaves.
%H A. Bickle and B. Phillips, <a href="https://allanbickle.files.wordpress.com/2016/05/ttonepaperb.pdf">t-Tone Colorings of Graphs</a>, Utilitas Math, 106 (2018) 85-102.
%H Allan Bickle, <a href="https://allanbickle.files.wordpress.com/2016/05/2tonejcpaper.pdf">2-Tone coloring of joins and products of graphs</a>, Congr. Numer. 217 (2013), 171-190.
%H N. Fonger, J. Goss, B. Phillips, and C. Segroves, <a href="https://web.archive.org/web/20220121030248/https://homepages.wmich.edu/~zhang/finalReport2.pdf">Math 6450: Final Report</a>, (2009).
%F a(n) = A003057(n-1) + 2.
%F a(n) = ceiling((5 + sqrt(1 + 8*n))/2).
%e For a star with three leaves, label the leaves 12, 13, and 23. Label the other vertex 45. A total of 5 colors are used, so a(3)=5.
%t Table[Ceiling[(5 + Sqrt[1 + 8*n])/2],{n,71}] (* _Stefano Spezia_, Dec 27 2021 *)
%Y Cf. A003057, A350362.
%K nonn,easy
%O 1,1
%A _Allan Bickle_, Dec 26 2021