

A319491


Number of minimal nonwordrepresentable connected graphs on n vertices.


0




OFFSET

5,3


COMMENTS

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.


LINKS



EXAMPLE

The wheel graph W_5 is the only minimal connected graph on 6 vertices that is not wordrepresentable.


CROSSREFS

All nonwordrepresentable connected graphs are in A290814.


KEYWORD

nonn,more


AUTHOR



STATUS

approved



