An improved upper bound on the maximum degree of terminal-pairable complete graphs (Q724885): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129648484, #quickstatements; #temporary_batch_1724809781087 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129648484 / rank | |||
Normal rank | |||
Latest revision as of 02:52, 28 August 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
