The following pages link to Petr Gregor (Q313800):
Displaying 50 items.
- On incidence coloring conjecture in Cartesian products of graphs (Q313802) (← links)
- Gray codes with bounded weights (Q442379) (← links)
- Testing connectivity of faulty networks in sublinear time (Q450565) (← links)
- Hamiltonian laceability of hypercubes without isometric subgraphs (Q503653) (← links)
- Generalized Gray codes with prescribed ends (Q512653) (← links)
- Rooted level-disjoint partitions of Cartesian products (Q669354) (← links)
- Long paths and cycles in hypercubes with faulty vertices (Q730940) (← links)
- Path partitions of hypercubes (Q975503) (← links)
- On generalized middle-level problem (Q985072) (← links)
- Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes (Q1024489) (← links)
- Broadcasting multiple messages in the 1-in port model in optimal time (Q1631684) (← links)
- Extending perfect matchings to Gray codes with prescribed ends (Q1648667) (← links)
- Towards a problem of Ruskey and Savage on matching extendability (Q1689953) (← links)
- Trimming and gluing Gray codes (Q1694730) (← links)
- On Hamiltonian alternating cycles and paths (Q1699287) (← links)
- Effective edge-fault-tolerant single-source spanners via best (or good) swap edges (Q1742786) (← links)
- Linear time construction of a compressed Gray code (Q1761499) (← links)
- Long cycles in hypercubes with optimal number of faulty vertices (Q1928522) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- Hamiltonian cycles and paths in hypercubes with disjoint faulty edges (Q2234783) (← links)
- Modelling simultaneous broadcasting by level-disjoint partitions (Q2279226) (← links)
- Hamiltonian paths with prescribed edges in hypercubes (Q2370437) (← links)
- Note on incidence chromatic number of subquartic graphs (Q2410036) (← links)
- On the mutually independent Hamiltonian cycles in faulty hypercubes (Q2446440) (← links)
- Recursive fault-tolerance of Fibonacci cube in hypercubes (Q2497470) (← links)
- Linear extension diameter of level induced subposets of the Boolean lattice (Q2509749) (← links)
- On the central levels problem (Q2692785) (← links)
- Hypercube 1-factorizations from extended Hamming codes (Q2851530) (← links)
- (Q2857368) (← links)
- (Q2857380) (← links)
- Queue Layouts of Hypercubes (Q2902890) (← links)
- Parity vertex colorings of binomial trees (Q2906376) (← links)
- Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model (Q2958310) (← links)
- Efficient Connectivity Testing of Hypercubic Networks with Faults (Q3000506) (← links)
- Hamiltonian fault-tolerance of hypercubes (Q3503505) (← links)
- (Q3575453) (← links)
- (Q3575463) (← links)
- (Q3576719) (← links)
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices (Q3648508) (← links)
- Gray Code Compression (Q3651545) (← links)
- (Q4536361) (← links)
- (Q4636639) (← links)
- A short proof of the middle levels theorem (Q4645033) (← links)
- (Q5002744) (← links)
- Embedded paths and cycles in faulty hypercubes (Q5891220) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)
- On the central levels problem (Q6330366) (← links)
- The Hamilton compression of highly symmetric graphs (Q6399331) (← links)
- Star transposition gray codes for multiset permutations (Q6490981) (← links)
- Combinatorial generation via permutation languages. VI. Binary trees (Q6510569) (← links)
