The following pages link to Petr Gregor (Q313800):
Displaying 20 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)
- Towards a problem of Ruskey and Savage on matching extendability (Q1689953) (← links)
- On Hamiltonian alternating cycles and paths (Q1699287) (← links)
- Linear time construction of a compressed Gray code (Q1761499) (← links)
- Embedded paths and cycles in faulty hypercubes (Q5891220) (← links)
- Star transposition gray codes for multiset permutations (Q6490981) (← links)
- The Hamilton compression of highly symmetric graphs (Q6505928) (← links)
- Combinatorial generation via permutation languages. VI. Binary trees (Q6510569) (← links)
- Hamiltonian graphs are cup-stackable (Q6517054) (← links)
- Generating all invertible matrices by row operations (Q6533101) (← links)
