53 citations · 178 across the 27 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2022
The Hamiltonian Path Graph is Connected for Simple Paths in Rectangular Grid Graphs
Rahnuma Islam Nishat, Venkatesh Srinivasan, Sue Whitesides
A \emph{simple} path in a rectangular grid graph is a Hamiltonian path from the top-left corner to the bottom-right corner such that each \emph{inter…
cs.DM2017★ 2 cited
A generalization of Schönemann's theorem via a graph theoretic method
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan
Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient condition…