Petr Gregor

From MaRDI portal
Person:313800

Available identifiers

zbMath Open gregor.petrMaRDI QIDQ313800

List of research outcomes





PublicationDate of PublicationType
Packing coloring of hypercubes with extended Hamming codes2024-11-06Paper
Combinatorial generation via permutation languages. VI: Binary trees2024-09-30Paper
The Hamilton compression of highly symmetric graphs2024-08-06Paper
Star transposition gray codes for multiset permutations2024-04-23Paper
Packing coloring of hypercubes with extended Hamming codes2023-12-22Paper
Star transposition Gray codes for multiset permutations2023-10-12Paper
On the central levels problem2023-03-23Paper
The Hamilton compression of highly symmetric graphs2022-05-17Paper
Gray codes and symmetric chains2022-01-26Paper
https://portal.mardi4nfdi.de/entity/Q50027442021-07-28Paper
Modelling simultaneous broadcasting by level-disjoint partitions2019-12-12Paper
On the central levels problem2019-12-03Paper
Rooted level-disjoint partitions of Cartesian products2019-03-15Paper
A short proof of the middle levels theorem2019-01-09Paper
Broadcasting multiple messages in the 1-in port model in optimal time2018-12-06Paper
Extending perfect matchings to Gray codes with prescribed ends2018-06-27Paper
https://portal.mardi4nfdi.de/entity/Q46366392018-04-19Paper
Trimming and gluing Gray codes2018-02-06Paper
Towards a problem of Ruskey and Savage on matching extendability2018-01-18Paper
Note on incidence chromatic number of subquartic graphs2017-10-17Paper
Generalized Gray codes with prescribed ends2017-02-27Paper
Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model2017-02-01Paper
Hamiltonian laceability of hypercubes without isometric subgraphs2017-01-13Paper
On incidence coloring conjecture in Cartesian products of graphs2016-09-12Paper
Linear extension diameter of level induced subposets of the Boolean lattice2014-07-29Paper
On the mutually independent Hamiltonian cycles in faulty hypercubes2014-04-16Paper
On the queue-number of the hypercube2013-11-01Paper
Linear extension diameter of subposets of Boolean lattice induced by two levels2013-11-01Paper
Long paths and cycles in faulty hypercubes: existence, optimality, complexity2013-10-10Paper
Hypercube 1-factorizations from extended Hamming codes2013-10-10Paper
Long cycles in hypercubes with optimal number of faulty vertices2013-01-03Paper
Linear time construction of a compressed Gray code2012-11-15Paper
Testing connectivity of faulty networks in sublinear time2012-09-13Paper
Parity vertex colorings of binomial trees2012-09-05Paper
Queue layouts of hypercubes2012-08-22Paper
Gray codes with bounded weights2012-08-10Paper
Efficient Connectivity Testing of Hypercubic Networks with Faults2011-05-19Paper
https://portal.mardi4nfdi.de/entity/Q35767192010-07-30Paper
https://portal.mardi4nfdi.de/entity/Q35754632010-07-27Paper
https://portal.mardi4nfdi.de/entity/Q35754532010-07-27Paper
On generalized middle-level problem2010-07-20Paper
Path partitions of hypercubes2010-06-09Paper
Gray code compression2009-12-11Paper
Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices2009-11-27Paper
Long paths and cycles in hypercubes with faulty vertices2009-10-01Paper
Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes2009-06-17Paper
Hamiltonian fault-tolerance of hypercubes2008-06-05Paper
Hamiltonian paths with prescribed edges in hypercubes2007-06-26Paper
Recursive fault-tolerance of Fibonacci cube in hypercubes2006-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45363612002-10-07Paper
Combinatorial generation via permutation languages. VI. Binary treesN/APaper
Hamiltonian graphs are cup-stackableN/APaper
Generating all invertible matrices by row operationsN/APaper

Research outcomes over time

This page was built for person: Petr Gregor