Ivan Havel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2003

On paths and cycles dominating hypercubesTomás Dvorák, Ivan Havel, Michel Mollard. DM, 262(1-3):121-129, 2003. [doi]

2001

Routing permutations and 2-1 routing requests in the hypercubeOlivier Baudon, Guillaume Fertin, Ivan Havel. DAM, 113(1):43-58, 2001.

On 2-periodic graphs of a certain graph operatorIvan Havel, Bohdan Zelinka. dmgt, 21(1):13-30, 2001. [doi]

1999

Routing Permutations in the HypercubeOlivier Baudon, Guillaume Fertin, Ivan Havel. criwg 1999: 179-190 [doi]

Euler Cycles in K::2m:: Plus Perfect MatchingTomás Dvorák, Ivan Havel, Petr Liebl. ejc, 20(3):227-232, 1999. [doi]

1997

Euler cycles in the complete graph K::2m+1::Tomás Dvorák, Ivan Havel, Petr Liebl. DM, 171(1-3):89-102, 1997. [doi]

Spanning caterpillars of a hypercubeTomás Dvorák, Ivan Havel, Jean-Marie Laborde, Michel Mollard. jgt, 24(1):9-19, 1997. [doi]

The Diameter of the Cube-Connected CyclesIvan Fris, Ivan Havel, Petr Liebl. ipl, 61(3):157-160, 1997. [doi]

1992

Distance monotone graphs and a new characterization of hypercubesGustav Burosch, Ivan Havel, Jean-Marie Laborde. DM, 110(1-3):9-16, 1992. [doi]

1986

One-legged caterpillars span hypercubesIvan Havel, Petr Liebl. jgt, 10(1):69-77, 1986. [doi]

1967

The GUHA method of systematical hypotheses searching. IIPetr Hájek, Ivan Havel, Metodej K. Chytil. kybernetika, 3(5):430-437, 1967. [doi]

1966

GUHA - the method of systematical hypotheses searchingPetr Hájek, Ivan Havel, Metodej K. Chytil. kybernetika, 2(1):31-47, 1966. [doi]

Sign in or sign up to see more results.

runs on WebDSL