| Tartalom: |
http://real.mtak.hu/71048/ |
| Archívum: |
MTA Könyvtár |
| Gyűjtemény: |
Status = Published
Type = Article
|
| Cím: |
Note on terminal-pairability in complete grid graphs
|
| Létrehozó: |
Győri, Ervin
Mezei, Tamás
Mészáros, Gábor
|
| Kiadó: |
North-Holland Publishing Company
|
| Dátum: |
2017
|
| Téma: |
QA166-QA166.245 Graphs theory / gráfelmélet
|
| Tartalmi leírás: |
We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel (1999) concerning the path-pairability of high-dimensional complete grid graphs. As an intriguing by-product of our result we significantly improve the estimate of the necessary maximum degree in path-pairable graphs, a question originally raised and studied by Faudree, Gyárfás, and Lehel (1999). © 2017 Elsevier B.V.
|
| Nyelv: |
angol
|
| Típus: |
Article
PeerReviewed
info:eu-repo/semantics/article
|
| Formátum: |
text
|
| Azonosító: |
Győri, Ervin and Mezei, Tamás and Mészáros, Gábor (2017) Note on terminal-pairability in complete grid graphs. DISCRETE MATHEMATICS, 340 (5). pp. 988-990. ISSN 0012-365X
|
| Kapcsolat: |
https://doi.org/10.1016/j.disc.2017.01.014
MTMT:3256577; doi:10.1016/j.disc.2017.01.014
|
