Janusz Dybizbański

most citedHamiltonian cycles and paths in hypercubes with disjoint faulty edges

7 citations · 11 across the 3 of their papers we have counts for

collaborators

3 papers

cs.DM2019★ 4 cited

Signified chromatic number of grids is at most 9

Janusz Dybizbanski

A signified graph is a pair $(G, Σ)$ where $G$ is a graph, and $Σ$ is a set of edges marked with ' $-$ '. Other edges are marked with ' $+$ '. A signified coloring of the signified gra…

cs.DM2018★ 7 cited

Hamiltonian cycles and paths in hypercubes with disjoint faulty edges

Janusz Dybizbański, Andrzej Szepietowski

We consider hypercubes with pairwise disjoint faulty edges. An $n$ -dimensional hypercube $Q_{n}$ is an undirected graph with $2^{n}$ nodes, each labeled with a distinct binary strings…

cs.DM2018

Hamiltonian cycles in hypercubes with faulty edges

Janusz Dybizbański, Andrzej Szepietowski

Szepietowski [A. Szepietowski, Hamiltonian cycles in hypercubes with $2 n - 4$ faulty edges, Information Sciences, 215 (2012) 75--82] observed that the hypercube $Q_{n}$ is not Hamilton…