An improved upper bound on the maximum degree of terminal-pairable complete graphs (Q724885): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1708.06837 / rank | |||
Normal rank | |||
Revision as of 16:15, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved upper bound on the maximum degree of terminal-pairable complete graphs |
scientific article |
Statements
An improved upper bound on the maximum degree of terminal-pairable complete graphs (English)
0 references
26 July 2018
0 references
terminal-pairability
0 references
demand graph
0 references
