Packing two graphs of order n having total size at most 2n-2 (Q803166)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing two graphs of order n having total size at most 2n-2 |
scientific article |
Statements
Packing two graphs of order n having total size at most 2n-2 (English)
0 references
1990
0 references
packable graphs
0 references
complement
0 references
