The following pages link to Tomáš Dvořák (Q414470):
Displaying 50 items.
- On-line suffix tree construction with reduced branching (Q414471) (← links)
- Gray codes with bounded weights (Q442379) (← links)
- Testing connectivity of faulty networks in sublinear time (Q450565) (← links)
- Generalized Gray codes with prescribed ends (Q512653) (← links)
- Computational complexity of long paths and cycles in faulty hypercubes (Q708231) (← links)
- Long paths in hypercubes with a quadratic number of faults (Q730952) (← links)
- Dense sets and embedding binary trees into hypercubes (Q869570) (← links)
- Path partitions of hypercubes (Q975503) (← links)
- Euler cycles in \(K_{2m}\) plus perfect matching (Q1289075) (← links)
- Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs (Q1348122) (← links)
- Matchings and Hadwiger's conjecture (Q1349093) (← links)
- Euler cycles in the complete graph \(K_{2m+1}\) (Q1363690) (← links)
- Divisibility of certain coefficients of the chromatic polynomials. (Q1420611) (← links)
- The chromatic uniqueness of certain complete \(t\)-partite graphs. (Q1420623) (← links)
- On Hamilton cycles in connected tetravalent metacirculant graphs with non-empty first symbol (Q1431395) (← links)
- Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
- Towards a problem of Ruskey and Savage on matching extendability (Q1689953) (← links)
- Linear time construction of a compressed Gray code (Q1761499) (← links)
- Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions (Q1773167) (← links)
- 11-doilies with vertex sets of sizes \(275, 286,\dots,462\) (Q1773843) (← links)
- Hamiltonian iterated line graphs (Q1849948) (← links)
- Chromaticity of a family of \(K_{4}\)-homeomorphs (Q1850049) (← links)
- On paths and cycles dominating hypercubes (Q1868842) (← links)
- Four coefficients of the characteristic polynomial of the Coxeter transformation. (Q1889477) (← links)
- Neighbor connectivity of \(k\)-ary \(n\)-cubes (Q2180667) (← links)
- On NP-hardness of the clique partition -- independence number gap recognition and related problems (Q2368935) (← links)
- Hamiltonian paths with prescribed edges in hypercubes (Q2370437) (← links)
- Spanning multi-paths in hypercubes (Q2370445) (← links)
- A relation between choosability and uniquely list colorability (Q2496207) (← links)
- Temperley-Lieb algebras and the four-color theorem (Q2567395) (← links)
- Classification of locally 2-connected compact metric spaces (Q2567410) (← links)
- IC-colorings and IC-indices of graphs (Q2568491) (← links)
- The crossing number of \((K_4-e)\times C_3\) (Q2715485) (← links)
- The Maple book (Q2770553) (← links)
- (Q2965984) (← links)
- Efficient Connectivity Testing of Hypercubic Networks with Faults (Q3000506) (← links)
- Cross-Border Returns Differentials<sup>*</sup> (Q3401214) (← links)
- Hamiltonian fault-tolerance of hypercubes (Q3503505) (← links)
- (Q3575463) (← links)
- (Q3576719) (← links)
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices (Q3648508) (← links)
- Gray Code Compression (Q3651545) (← links)
- (Q4027153) (← links)
- Gray codes extending quadratic matchings (Q4995564) (← links)
- Spanning caterpillars of a hypercube (Q5284591) (← links)
- Hamiltonian Cycles with Prescribed Edges in Hypercubes (Q5317603) (← links)
- (Q5750881) (← links)
- Long paths and cycles in faulty hypercubes: existence, optimality, complexity (Q5891220) (← links)
- On topological aspects of orientations (Q5931445) (← links)
- On the elusiveness of Hamiltonian property (Q5931908) (← links)
