Paper Info
Title
Packing of graphs and permutations—a survey
Abstract
An embedding of a graph G (into its complement Ḡ) 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). If there exists an embedding of G we say that G is embeddable or that there is a packing of two copies of the graph G into complete graph Kn. In this paper we discuss a variety of results, some quite recent, concerning the relationships between the embeddings of graphs in their complements and the structure of the embedding permutations.
Year
DOI
Venue
2004
10.1016/S0012-365X(03)00296-6
Discrete Mathematics
Keywords
Field
DocType
Packing of graphs,Self-complementary graphs,Permutation (structure)
Discrete mathematics,Combinatorics,Strongly regular graph,Vertex-transitive graph,Forbidden graph characterization,Graph power,Graph embedding,Book embedding,Symmetric graph,Mathematics,Complement graph
Journal
Volume
Issue
ISSN
276
1
0012-365X
Citations 
PageRank 
References 
3
0.50
15
Authors
1
Name
Order
Citations
PageRank
Mariusz Woźniak120434.54