

A246506


a(n) is the number m_0 with the property that if m >= m_0, then every graph obtained from the complete bipartite graph K_{m,m+n} by deleting two edges is chromatically unique.


0




OFFSET

2,1


COMMENTS

Giudici, Reinaldo E.; de Sá, Eduardo Lima. Chromatic uniqueness of certain bipartite graphs. Proceedings of the Twentyfirst Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1990). Congr. Numer. 76 (1990), 6975. MR1140419 (92i:05094)


LINKS

Table of n, a(n) for n=2..11.


CROSSREFS

Sequence in context: A024733 A252732 A011472 * A001733 A266952 A245423
Adjacent sequences: A246503 A246504 A246505 * A246507 A246508 A246509


KEYWORD

nonn,more


AUTHOR

N. J. A. Sloane, Aug 27 2014


STATUS

approved



