Namrata

activity

20222026

most citedOn the Hardness of Gray Code Problems for Combinatorial Objects

1 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DM2024★ 1 cited

On the Hardness of Gray Code Problems for Combinatorial Objects

Arturo Merino, Namrata, Aaron Williams

Can a list of binary strings be ordered so that consecutive strings differ in a single bit? Can a list of permutations be ordered so that consecutive permutations differ by a swap?…

math.CO2024★ 1 cited

Hamiltonicity of Schrijver graphs and stable Kneser graphs

Torsten Mütze, Namrata

For integers $k \geq 1$ and $n \geq 2 k + 1$ , the Schrijver graph $S (n, k)$ has as vertices all $k$ -element subsets of $[n] := {1, 2, \dots, n}$ that contain no two cyclically adjacent ele…