Packing a tree of order \(p\) with a \((p,p+1)\)-graph (Q1873645)
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: Packing a tree of order \(p\) with a \((p,p+1)\)-graph |
scientific article; zbMATH DE number 1917036
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing a tree of order \(p\) with a \((p,p+1)\)-graph |
scientific article; zbMATH DE number 1917036 |
Statements
Packing a tree of order \(p\) with a \((p,p+1)\)-graph (English)
0 references
14 January 2004
0 references
A \((p,m)\)-graph is a graph of order \(p\) and size \(m\). Let \(G_1\) and \(G_2\) be two graphs of the same order. If \(G_1\) is isomorphic to a spanning subgraph of the complement of \(G_2\), then \(G_1\) and \(G_2\) are called packable. The authors present a necessary and sufficient condition for a tree of order \(p\) and a \((p,p+1)\)-graph to be packable.
0 references
packing
0 references
tree
0 references
0.8587389588356018
0 references
0.8353110551834106
0 references
0.8322685360908508
0 references
