Random packing by \(\rho\)-connected \(\rho\)-regular graphs (Q1126281)
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: Random packing by -connected -regular graphs |
scientific article; zbMATH DE number 955143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random packing by \(\rho\)-connected \(\rho\)-regular graphs |
scientific article; zbMATH DE number 955143 |
Statements
Random packing by \(\rho\)-connected \(\rho\)-regular graphs (English)
0 references
5 February 2001
0 references
packing
0 references
packable graph
0 references
forbidden graph
0 references
characterization
0 references
0 references
0.9419565
0 references
0.9385854
0 references
0 references
0 references
0.9011434
0 references
0.9009411
0 references
