He observes that every comparability graph is complete , is bipartite , or has a skew partition .
A simpler example of a structural decomposition using skew partitions is given by Seymour ( 2006 ) .
Seymour observes that every comparability graph is complete , is bipartite , or has a skew partition .
A simpler example of a structural decomposition using skew partitions is given by Seymour ( 2006 ) .