Petr Gregor

Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices

Given a set

Recursive fault-tolerance of Fibonacci cube in hypercubes

\pc=\{a_i,b_i\}_{i=1}^m

Long cycles in hypercubes with optimal number of faulty vertices

of pairs of vertices in a graph

Hamiltonian fault-tolerance of hypercubes

G

On incidence coloring conjecture in Cartesian products of graphs

, is there a collection of paths

Rooted level-disjoint partitions of Cartesian products

\{P_i\}_{i=1}^m

Parity vertex colorings of binomial trees

such that

Trimming and Gluing Gray Codes.

P_i

Generalized Gray codes with prescribed ends

connects

Modelling simultaneous broadcasting by level-disjoint partitions

a_i