论文信息 - On cyclically embeddable (n, n)-graphs

On cyclically embeddable (n, n)-graphs

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)-graphs. We prove that with few exceptions the corresponding permutation may be chosen as cyclic one.

Mariusz Wozniak | Monika Pilsniak | Agnieszka Görlich

[1] Seymour Schuster,et al. Embedding (p,p−1) graphs in their complements , 1978 .

[2] Mariusz Wozniak,et al. On cyclically embeddable (n, n-1)-graphs , 2002, Discret. Math..

[3] David Burns,et al. Every (p, p-2) graph is contained in its complement , 1977, J. Graph Theory.

[4] Hian Poh Yap,et al. Packing of graphs - a survey , 1988, Discret. Math..

[5] Béla Bollobás,et al. Packings of graphs and applications to computational complexity , 1978, J. Comb. Theory, Ser. B.

[6] Mariusz Woźniak. Packing of graphs , 1997 .

[7] Mariusz Wozniak,et al. On cyclically embeddable graphs , 1999, Discuss. Math. Graph Theory.

[8] T. Gangopadhyay. Packing graphs in their complements , 1998, Discret. Math..