On cyclically embeddable graphs

Mariusz Woźniak
1999 Discussiones Mathematicae Graph Theory  
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 some families of embeddable graphs such that the corresponding permutation is cyclic.
doi:10.7151/dmgt.1099 fatcat:q3jrvxd6vvhpbfarncjxnwv2i4