Name
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). |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.disc.2017.01.014 | Discrete Mathematics |
Keywords | Field | DocType |
Path-pairability,Terminal-pairability,Complete grid graphs | Discrete mathematics,Graph,Indifference graph,Combinatorics,Chordal graph,Degree (graph theory),1-planar graph,Longest path problem,Grid,Mathematics | Journal |
Volume | Issue | ISSN |
340 | 5 | 0012-365X |
Citations | PageRank | References |
2 | 0.47 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ervin Györi | 1 | 88 | 21.62 |
| Tamás Róbert Mezei | 2 | 2 | 1.82 |
| Gábor Mészáros | 3 | 4 | 3.62 |