An improved upper bound on the maximum degree of terminal-pairable complete graphs (Q724885): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963732236 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1708.06837 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Terminal-pairability in complete bipartite graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Networks communicating for each pairing of terminals / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4018554 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3139528 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4243059 / rank | |||
Normal rank | |||
Revision as of 05:53, 16 July 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
