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
|
Text
1606.06826v1.pdf Download (120kB) | Preview |
Official URL: https://doi.org/10.1016/j.disc.2017.01.014
Abstract
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Terminal-pairability; Path-pairability; Complete grid graphs |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 13 Dec 2017 14:42 |
| Last Modified: | 13 Dec 2017 14:42 |
| URI: | http://real.mtak.hu/id/eprint/71048 |
Actions (login required)
 |
Edit Item |
