login
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
7, 7, 7, 9, 11, 14, 17, 21, 25, 30
OFFSET
2,1
REFERENCES
Reinaldo E. Guidici and Eduardo Lima de Sá, Chromatic uniqueness of certain bipartite graphs. Proceedings of the Twenty-first Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1990). Congr. Numer. 76 (1990), 69-75. MR1140419 (92i:05094)
CROSSREFS
Sequence in context: A252732 A360807 A011472 * A001733 A266952 A245423
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 27 2014
STATUS
approved