%I
%S 0,1,10,47,179
%N Number of minimal nonwordrepresentable connected graphs on n vertices.
%C A simple graph G=(V,E) is wordrepresentable if there exists a word w over the alphabet V such that letters x and y alternate in w iff xy is an edge in E. Wordrepresentable graphs generalize several important classes of graphs.
%H Ozgur Akgun, Ian P. Gent, Sergey Kitaev, Hans Zantema, <a href="https://arxiv.org/abs/1808.01215">Solving computational problems in the theory of wordrepresentable graphs</a>, arXiv:1808.01215 [math.CO], 2018.
%H Sergey Kitaev, <a href="https://arxiv.org/abs/1705.05924">A comprehensive introduction to the theory of wordrepresentable graphs</a>, arXiv:1705.05924 [math.CO], 2017.
%e The wheel graph W_5 is the only minimal connected graph on 6 vertices that is not wordrepresentable.
%Y All nonwordrepresentable connected graphs are in A290814.
%K nonn,more
%O 5,3
%A _Sergey Kitaev_, Sep 20 2018
