Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges (Q6640964)
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: Characterization of Pā Pā-equipackable graphs with 3m (m 1) edges |
scientific article; zbMATH DE number 7946948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges |
scientific article; zbMATH DE number 7946948 |
Statements
Characterization of \(P_3\cup P_2\)-equipackable graphs with \(3m\) \((m\geq 1)\) edges (English)
0 references
20 November 2024
0 references
\(H\)-packing
0 references
\(H\)-packable graph
0 references
randomly \(H\)-packable graph
0 references
\(H\)-equipackable graph
0 references
disconnected graph
0 references
0.8308660984039307
0 references
0.8248275518417358
0 references
0.823245644569397
0 references
0.8049608469009399
0 references
0.8005260229110718
0 references
