Some results on packing graphs in their complements (Q2761066)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some results on packing graphs in their complements |
scientific article; zbMATH DE number 1682927
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some results on packing graphs in their complements |
scientific article; zbMATH DE number 1682927 |
Statements
17 December 2001
0 references
self-packing graph
0 references
tree-covered graph
0 references
0 references
0 references
0 references
0 references
0.93408287
0 references
0.9297922
0 references
0 references
0.92831326
0 references
Some results on packing graphs in their complements (English)
0 references
A graph \(G\) is called self-packing, if there exist an imbedding (packing) of \(G\) into its complement. If a graph \(H\) has a subgraph \(G\) and the graph obtained from \(H\) by deleting all edges of \(G\) consists of \(n\) vertex-disjoint trees, where \(n\) is the number of vertices of \(G\), with the property that anyone of these trees has exactly one common vertex with \(G\), then \(H\) is said to be tree-covered. The main theorem gives the conditions under which a tree-covered graph \(H\) with the corresponding graph \(G\) being self-packing is itself self-packing.
0 references
