The GUHA method of automatic hypotheses determination. - Petr Hájek 001; Ivan Havel; Metodej K. Chytil (Computing, 1966)

GUHA - the method of systematical hypotheses searching. - Petr Hájek 001; Ivan Havel; Metodej K. Chytil (Kybernetika, 1966)

The GUHA method of systematical hypotheses searching. II. - Petr Hájek 001; Ivan Havel; Metodej K. Chytil (Kybernetika, 1967)

One-legged caterpillars span hypercubes. - Ivan Havel; Petr Liebl (J. Graph Theory, 1986)

Distance monotone graphs and a new characterization of hypercubes. - Gustav Burosch; Ivan Havel; Jean-Marie Laborde (Discret. Math., 1992)

Euler cycles in the complete graph K2m+1. - Tomás Dvorák; Ivan Havel; Petr Liebl (Discret. Math., 1997)

The Diameter of the Cube-Connected Cycles. - Ivan Fris; Ivan Havel; Petr Liebl (Inf. Process. Lett., 1997)

Spanning caterpillars of a hypercube. - Tomás Dvorák; Ivan Havel; Jean-Marie Laborde; Michel Mollard (J. Graph Theory, 1997)

Routing Permutations in the Hypercube. - Olivier Baudon; Guillaume Fertin; Ivan Havel (WG, 1999)

Euler Cycles in K2m Plus Perfect Matching. - Tomás Dvorák; Ivan Havel; Petr Liebl (Eur. J. Comb., 1999)

Routing permutations and 2-1 routing requests in the hypercube. - Olivier Baudon; Guillaume Fertin; Ivan Havel (Discret. Appl. Math., 2001)

On 2-periodic graphs of a certain graph operator. - Ivan Havel; Bohdan Zelinka (Discuss. Math. Graph Theory, 2001)

On paths and cycles dominating hypercubes. - Tomás Dvorák; Ivan Havel; Michel Mollard (Discret. Math., 2003)