ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Mathematicae Graph Theory 19(2) (1999) 241-248 DOI: 10.7151/dmgt.1099
Faculty of Applied Mathematics AGH
Department of Discrete Mathematics
Al. Mickiewicza 30, 30-059 Kraków, Poland
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 fami-lies of embeddable graphs such that the
corresponding permutation is cyclic.
Keywords: packing of graphs, unicyclic graphs, cyclic permutation.
1991 Mathematics Subject Classification: 05C70, 05C35.
Received 22 February 1999
Revised 27 October 1999