Note on terminal-pairability in complete grid graphs (Q512572): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6689476 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
path-pairability | |||
| Property / zbMATH Keywords: path-pairability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
terminal-pairability | |||
| Property / zbMATH Keywords: terminal-pairability / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complete grid graphs | |||
| Property / zbMATH Keywords: complete grid graphs / rank | |||
Normal rank | |||
Revision as of 03:11, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on terminal-pairability in complete grid graphs |
scientific article |
Statements
Note on terminal-pairability in complete grid graphs (English)
0 references
27 February 2017
0 references
path-pairability
0 references
terminal-pairability
0 references
complete grid graphs
0 references
