The following pages link to Jiří Fink (Q442378):
Displaying 17 items.
- Gray codes with bounded weights (Q442379) (← links)
- Some remarks on inverse Wiener index problem (Q444451) (← links)
- Testing connectivity of faulty networks in sublinear time (Q450565) (← links)
- Long paths and cycles in hypercubes with faulty vertices (Q730940) (← links)
- Matching graphs of hypercubes and complete bipartite graphs (Q1039435) (← links)
- Towards a problem of Ruskey and Savage on matching extendability (Q1689953) (← links)
- Long cycles in hypercubes with optimal number of faulty vertices (Q1928522) (← links)
- Greedy algorithm for local heating problem (Q2019427) (← links)
- Two algorithms extending a perfect matching of the hypercube into a Hamiltonian cycle (Q2189829) (← links)
- Arc-routing for winter road maintenance (Q2234739) (← links)
- Perfect matchings extend to Hamilton cycles in hypercubes (Q2384812) (← links)
- Matchings extend into 2-factors in hypercubes (Q2416511) (← links)
- Linear extension diameter of level induced subposets of the Boolean lattice (Q2509749) (← links)
- (Q2856701) (← links)
- (Q2857368) (← links)
- Efficient Connectivity Testing of Hypercubic Networks with Faults (Q3000506) (← links)
- Gray codes extending quadratic matchings (Q4995564) (← links)
