Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes. - Rostislav Caha; Petr Gregor (MFCS, 2000)

Recursive fault-tolerance of Fibonacci cube in hypercubes. - Petr Gregor (Discret. Math., 2006)

Hamiltonian paths with prescribed edges in hypercubes. - Tomás Dvorák; Petr Gregor (Discret. Math., 2007)

Hamiltonian fault-tolerance of hypercubes. - Tomás Dvorák; Petr Gregor (Electron. Notes Discret. Math., 2007)

Path partitions of hypercubes. - Petr Gregor; Tomás Dvorák (Inf. Process. Lett., 2008)

Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices. - Tomás Dvorák; Petr Gregor (SIAM J. Discret. Math., 2008)

Gray Code Compression. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (IWOCA, 2009)

Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. - Petr Gregor (Discret. Math., 2009)

Gray Codes Avoiding Matchings. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2009)

Long cycles in hypercubes with distant faulty vertices. - Petr Gregor; Riste Skrekovski (Discret. Math. Theor. Comput. Sci., 2009)

Long paths and cycles in faulty hypercubes: existence, optimality, complexity. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek (Electron. Notes Discret. Math., 2009)

Hypercube 1-factorizations from extended Hamming codes. - Petr Gregor (Electron. Notes Discret. Math., 2009)

Long paths and cycles in hypercubes with faulty vertices. - Jirí Fink; Petr Gregor (Inf. Sci., 2009)

Efficient Connectivity Testing of Hypercubic Networks with Faults. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek; Tomasz Radzik (IWOCA, 2010)

On generalized middle-level problem. - Petr Gregor; Riste Skrekovski (Inf. Sci., 2010)

Linear extension diameter of subposets of Boolean lattice induced by two levels. - Jirí Fink; Petr Gregor (Electron. Notes Discret. Math., 2011)

On the queue-number of the hypercube. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (Electron. Notes Discret. Math., 2011)

Gray codes with bounded weights. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek (Discret. Math., 2012)

Parity vertex colorings of binomial trees. - Petr Gregor; Riste Skrekovski (Discuss. Math. Graph Theory, 2012)

Long cycles in hypercubes with optimal number of faulty vertices. - Jirí Fink; Petr Gregor (J. Comb. Optim., 2012)

Testing connectivity of faulty networks in sublinear time. - Tomás Dvorák; Jirí Fink; Petr Gregor; Václav Koubek; Tomasz Radzik (J. Discrete Algorithms, 2012)

Queue Layouts of Hypercubes. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (SIAM J. Discret. Math., 2012)

Linear time construction of a compressed Gray code. - Darko Dimitrov; Tomás Dvorák; Petr Gregor; Riste Skrekovski (Eur. J. Comb., 2013)

Distance magic labelings of hypercubes. - Petr Gregor; Petr Kovár (Electron. Notes Discret. Math., 2013)

Edge-fault-tolerant hamiltonicity of augmented cubes. - Krystof Mekuta; Petr Gregor (Electron. Notes Discret. Math., 2013)

On the mutually independent Hamiltonian cycles in faulty hypercubes. - Vida Vukasinovic; Petr Gregor; Riste Skrekovski (Inf. Sci., 2013)

Linear extension diameter of level induced subposets of the Boolean lattice. - Jirí Fink; Petr Gregor (Eur. J. Comb., 2014)

Rooted level-disjoint partitions of Cartesian products. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (Appl. Math. Comput., 2015)

Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (COCOA, 2016)

On incidence coloring conjecture in Cartesian products of graphs. - Petr Gregor; Borut Luzar; Roman Soták (Discret. Appl. Math., 2016)

Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs. - David Pegrímek; Petr Gregor (Graphs Comb., 2016)

A short proof of the middle levels theorem. - Petr Gregor; Torsten Mütze; Jerri Nummenpalo (CoRR, 2017)

Towards a problem of Ruskey and Savage on matching extendability. - Jirí Fink; Tomás Dvorák; Petr Gregor; Tomás Novotný (Electron. Notes Discret. Math., 2017)

Note on incidence chromatic number of subquartic graphs. - Petr Gregor; Borut Luzar; Roman Soták (J. Comb. Optim., 2017)

Generalized Gray codes with prescribed ends. - Tomás Dvorák; Petr Gregor; Václav Koubek (Theor. Comput. Sci., 2017)

Quest for Good Spanners of Hypercubes. - David Kubon; Petr Gregor (CEC, 2018)

Modelling simultaneous broadcasting by level-disjoint partitions. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (Appl. Math. Comput., 2018)

Extending Perfect Matchings to Gray Codes with Prescribed Ends. - Petr Gregor; Tomás Novotný; Riste Skrekovski (Electron. J. Comb., 2018)

Broadcasting multiple messages in the 1-in port model in optimal time. - Petr Gregor; Riste Skrekovski; Vida Vukasinovic (J. Comb. Optim., 2018)

Trimming and gluing Gray codes. - Petr Gregor; Torsten Mütze (Theor. Comput. Sci., 2018)

Redundant binary representations with rigorous trade-off between connectivity and locality. - Vida Vukasinovic; David Kubon; Riste Skrekovski; Petr Gregor (GECCO Companion, 2020)

The Hamilton Compression of Highly Symmetric Graphs. - Petr Gregor; Arturo Merino; Torsten Mütze (MFCS, 2022)

Gray codes and symmetric chains. - Petr Gregor; Sven Jäger 001; Torsten Mütze; Joe Sawada; Kaja Wille (J. Comb. Theory B, 2022)

Pattern-Avoiding Binary Trees - Generation, Counting, and Bijections. - Petr Gregor; Torsten Mütze; Namrata (ISAAC, 2023)

On the central levels problem. - Petr Gregor; Ondrej Micka; Torsten Mütze (J. Comb. Theory B, 2023)

Star transposition Gray codes for multiset permutations. - Petr Gregor; Arturo Merino; Torsten Mütze (J. Graph Theory, 2023)

Generating All Invertible Matrices by Row Operations. - Petr Gregor; Hung P. Hoang 001; Arturo Merino; Ondrej Micka (ISAAC, 2024)

Packing coloring of hypercubes with extended Hamming codes. - Petr Gregor; Jaka Kranjc; Borut Luzar; Kenny Storgel (Discret. Appl. Math., 2024)

Combinatorial generation via permutation languages. VI. Binary trees. - Petr Gregor; Torsten Mütze; Namrata (Eur. J. Comb., 2024)

Graphs that admit a Hamilton path are cup-stackable. - Petr Gregor; Arturo Merino; Torsten Mütze; Francesco Verciani (Discret. Math., 2025)