Packing a number of copies of a \(( p , q )\)-graph (Q2217483): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 2002.01266 / rank | |||
Normal rank | |||
Revision as of 02:30, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Packing a number of copies of a \(( p , q )\)-graph |
scientific article |
Statements
Packing a number of copies of a \(( p , q )\)-graph (English)
0 references
29 December 2020
0 references
\( ( p
0 references
q )\)-graph
0 references
2-factor
0 references
\(k\)-placeable
0 references
