On cyclically embeddable (n,n−1)-graphs

Mariusz Woźniak
2002 Discrete Mathematics  
An embedding of a simple graph G into its complement G is a permutation on V (G) such that if an edge xy belongs to E(G), then (x) (y) does not belong to E(G). In this note we consider the embeddable (n; n − 1)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.
doi:10.1016/s0012-365x(01)00339-9 fatcat:n3pdowolqja4raopwd432wl4hm