# Is there a list of forbidden subgraphs for comparability graphs?

The "graph classes: a survey" mentioned Trotter and other authors have presented a list of forbidden subgraph of comparability graph. But the google book( where I read graph classes: a survey) do not have the page which contains the reference of specific literature. To my knowledge, one forbidden graph is "a k-cycle ( k is an odd intege $\ge$ 5) and no triangle chord".

-

You could refer to the entry for comparability graphs on graphclasses.org: http://www.graphclasses.org/classes/gc_72.html (look at "equivalent classes" and note that the list is not finite)

-
Although Stefan is right, the infinite part is simply "odd-hole-free". The list also has helpful links to pictures of all the other excluded graphs. –  András Salamon Dec 3 '12 at 18:57
No, András, every one of those "n"s in the exponents of many of the forbidden configurations are arbitrary parameters ... each one of those XF^ symbols is an infinite family of graphs. Also, the subscript $n$ for co-holes is another infinite set of forbidden graphs. It's not only the odd holes. –  Jim Nastos Feb 19 at 18:34