Pages that link to "Item:Q512653"
From MaRDI portal
The following pages link to Generalized Gray codes with prescribed ends (Q512653):
Displaying 16 items.
- Gray codes with bounded weights (Q442379) (← links)
- A construction of Gray codes inducing complete graphs (Q941339) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- Gray codes with restricted density (Q1062075) (← links)
- Gray arrays and Gray tori (Q1185897) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- Linear time construction of a compressed Gray code (Q1761499) (← links)
- Antipodal Gray codes (Q1827713) (← links)
- Torus-like graphs and their paired many-to-many disjoint path covers (Q2217462) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- A simple proof for the existence of exponentially balanced Gray codes (Q2571312) (← links)
- (Q3471700) (← links)
- (Q3816026) (← links)
- Construction of uniform Gray codes (Q3975295) (← links)
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elements (Q6138830) (← links)