Tomáš Dvořák

activity

20152019

most citedGeneralized Gray codes with prescribed ends

10 citations · 14 across the 4 of their papers we have counts for

collaborators

Showing cs.DMShow all

4 papers · 1 filter

cs.DM2019★ 1 cited

Neighbor connectivity of $k$ -ary $n$ -cubes

Tomáš Dvořák, Mei-Mei Gu

The neighbor connectivity of a graph $G$ is the least number of vertices such that removing their closed neighborhoods from $G$ results in a graph that is disconnected, complete or…

cs.DM2017★ 1 cited

Generalized Gray codes with prescribed ends of small dimensions

Tomáš Dvořák, Václav Koubek

Given pairwise distinct vertices ${α_{i}, β_{i}}_{i = 1}^{k}$ of the $n$ -dimensional hypercube $Q_{n}$ such that the distance of $α_{i}$ and $β_{i}$ is odd, are there paths $P_{i}$ between $α_i…

cs.DM2016★ 10 cited

Generalized Gray codes with prescribed ends

Tomáš Dvořák, Petr Gregor, Václav Koubek

An $n$ -bit Gray code is a sequence of all $n$ -bit strings such that consecutive strings differ in a single bit. It is well-known that given $α, β \in {0, 1}^{n}$ , an $n$ -bit Gray code…

cs.DM2015★ 2 cited

Matchings of quadratic size extend to long cycles in hypercubes