Ivan Havel

According to our database, Ivan Havel authored at least 13 papers between 1966 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

On paths and cycles dominating hypercubes.

Tomás Dvorák, Ivan Havel, Michel Mollard

Discret. Math., 2003

2001

On 2-periodic graphs of a certain graph operator.

Ivan Havel, Bohdan Zelinka

Discuss. Math. Graph Theory, 2001

Routing permutations and 2-1 routing requests in the hypercube.

Olivier Baudon, Guillaume Fertin, Ivan Havel

Discret. Appl. Math., 2001

1999

Euler Cycles in K_2m Plus Perfect Matching.

Tomás Dvorák, Ivan Havel, Petr Liebl

Eur. J. Comb., 1999

Routing Permutations in the Hypercube.

Olivier Baudon, Guillaume Fertin, Ivan Havel

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1997

Spanning caterpillars of a hypercube.

Tomás Dvorák, Ivan Havel, Jean-Marie Laborde, Michel Mollard

J. Graph Theory, 1997

The Diameter of the Cube-Connected Cycles.

Ivan Fris, Ivan Havel, Petr Liebl

Inf. Process. Lett., 1997

Euler cycles in the complete graph K_2m+1.

Tomás Dvorák, Ivan Havel, Petr Liebl

Discret. Math., 1997

1992

Distance monotone graphs and a new characterization of hypercubes.

Gustav Burosch, Ivan Havel, Jean-Marie Laborde

Discret. Math., 1992

1986

One-legged caterpillars span hypercubes.

Ivan Havel, Petr Liebl

J. Graph Theory, 1986

1967

The GUHA method of systematical hypotheses searching. II.

Petr Hájek, Ivan Havel, Metodej K. Chytil

Kybernetika, 1967

1966

GUHA - the method of systematical hypotheses searching.

Petr Hájek, Ivan Havel, Metodej K. Chytil

Kybernetika, 1966

The GUHA method of automatic hypotheses determination.

Petr Hájek, Ivan Havel, Metodej K. Chytil

Computing, 1966