An improved upper bound on the maximum degree of terminal-pairable complete graphs (Q724885): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:19, 30 January 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
