%I #23 Nov 30 2023 07:14:50
%S 6,6,5,5,6,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
%T 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5
%N 2-tone chromatic number of an n-cycle.
%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 There is no 2-tone 5-coloring for cycles of length 3, 4, or 7 since the Petersen graph does not contain cycles of these lengths.
%H Allan 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>, Group #2 Study Project, 2009.
%H <a href="/index/Con#constant">Index entries for eventually constant sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F a(n) = 5 for all n>7.
%F G.f.: x^3*(1 + x + x^4) + 5*x^3/(1 - x). - _Stefano Spezia_, Dec 27 2021
%e The colorings for (broken) cycles with orders 3 through 9 are shown below.
%e -12-34-56-
%e -12-34-15-36-
%e -12-34-51-23-45-
%e -12-34-15-32-14-35-
%e -12-34-56-13-24-35-46-
%e -12-34-15-23-14-25-13-45-
%e -12-34-15-32-14-25-13-24-35-
%e Colorings for larger cycles can be spliced together from broken cycles of lengths 5, 6, and 8.
%t PadRight[{6,6,5,5,6},100,5] (* _Paolo Xausa_, Nov 30 2023 *)
%Y Cf. A350361.
%K nonn,easy
%O 3,1
%A _Allan Bickle_, Dec 26 2021
|