Published in

Elsevier, Discrete Mathematics, 5(340), p. 988-990, 2017

DOI: 10.1016/j.disc.2017.01.014

Links

Tools

Export citation

Search in Google Scholar

Note on Terminal-Pairability in Complete Grid Graphs

Journal article published in 2016 by Ervin Györi, Tamás Róbert Mezei ORCID, Gábor Mészáros
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

We affirmatively answer and generalize the question of Kubicka, Kubicki and Lehel 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. ; Comment: 5 pages