Pages that link to "Item:Q1208348"
From MaRDI portal
The following pages link to Universal cycles for combinatorial structures (Q1208348):
Displaying 16 items.
- Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences (Q3117226) (← links)
- Containing All Permutations (Q5144492) (← links)
- On a Greedy Algorithm to Construct Universal Cycles for Permutations (Q5384431) (← links)
- Overlap Cycles for Steiner Quadruple Systems (Q5406985) (← links)
- The feasible region for consecutive patterns of permutations is a cycle polytope (Q5918948) (← links)
- The feasible region for consecutive patterns of permutations is a cycle polytope (Q5919059) (← links)
- Harmonious and achromatic colorings of fragmentable hypergraphs (Q5920082) (← links)
- Graph universal cycles: compression and connections to universal cycles (Q6044313) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
- Constructing the first (and coolest) fixed-content universal cycle (Q6103527) (← links)
- Graphs with the unique path property: Structure, cycles, factors, and constructions (Q6142656) (← links)
- An embedding technique in the study of word-representability of graphs (Q6153476) (← links)
- Short k‐radius sequences, k‐difference sequences and universal cycles (Q6187437) (← links)
- Cycle decompositions in \(k\)-uniform hypergraphs (Q6500099) (← links)
- Euler's theorem for regular CW-complexes (Q6548024) (← links)
- On a family of universal cycles for multi-dimensional permutations (Q6633546) (← links)
