Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing two copies of a sparse graph into a graph with restrained maximum degree |
scientific article |
Statements
Packing two copies of a sparse graph into a graph with restrained maximum degree (English)
0 references
18 December 2009
0 references
embedding
0 references
packing
0 references
trees
0 references
