11 citations · 11 across the 2 of their papers we have counts for
2 papers
math.CO2016★ 11 cited
Note on Terminal-Pairability in Complete Grid Graphs
Ervin Györi, Tamás Róbert Mezei, Gábor Mészáros
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-prod…
math.CO2014
Frustrated Triangles
Teeradej Kittipassorn, Gabor Meszaros
A triple of vertices in a graph is a \emph{frustrated triangle} if it induces an odd number of edges. We study the set of possible number of frustrated…