11 citations · 12 across the 6 of their papers we have counts for
4 papers · 2 filters
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…
Note on the Diameter of Path-Pairable Graphs
Gabor Meszaros
A graph on vertices is path-pairable if for any pairing of the vertices the pairs can be joined by edge-disjoint paths. The so far known families of path-pairable graphs have…
On Path-Pairability of Cartesian Product of Complete Bipartite Graphs
Gabor Meszaros
We study inheritance of path-pairability in the Cartesian product of graphs, and prove different (such as additive and multiplicative) inheritance patterns of path-pairability, dep…
On Linkedness of Cartesian Product of Graphs
Gabor Meszaros
We study linkedness of Cartesian product of graphs and prove that the product of an -linked and a -linked graphs is -linked if the graphs are sufficiently large. Fur…