Szczegóły publikacji
Opis bibliograficzny
Packing of graphs and permutations – a survey / Mariusz WOŹNIAK // Discrete Mathematics ; ISSN 0012-365X. — 2004 — vol. 276 iss. 1–3, s. 379–391. — Bibliogr. s. 390–391, Abstr. — Publikacja dostępna online od: 2003-09-06. — 6th international conference on Graph theory : Marseille, France, August 28-September 02, 2000
Autor
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 19194 |
|---|---|
| Data dodania do BaDAP | 2005-01-25 |
| Tekst źródłowy | URL |
| DOI | 10.1016/S0012-365X(03)00296-6 |
| Rok publikacji | 2004 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Creative Commons | |
| Czasopismo/seria | Discrete Mathematics |
Abstract
An embedding of a graph G (into its complement (G) over bar) is a permutation sigma on V(G) such that if an edge xy belongs to E(G) then sigma(x)sigma(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 K-n. 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. (C) 2003 Elsevier B.V. All rights reserved.
