Výsledky vyhledávání

Euler cycles in the complete graph K2m+1

Autor: Petr Liebl, Ivan M. Havel, Tomáš Dvořák

Publikováno v: ResearcherID

We analyze the freedom one has when walking along an Euler cycle through a complete graph of an odd order: Is it possible, for any cycle C of ( 2 2 m + 1 ) vertices, 2 m + 1 of them being black, to find an edge monomorphism of C onto K 2 m + 1 , that

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1aeef9b8fc856a8f8bdb5775456904df

Zobrazit plný text záznamu

The diameter of the cube-connected cycles

Autor: Petr Liebl, Ivan M. Havel, Ivan Friš

Publikováno v: Information Processing Letters. 61:157-160

Cube-connected cycles, or CCC, are graphs with properties which make them possible candidates for switching patterns of multiprocessor computers. In this paper, the diameter of CCC is calculated. In fact, the same calculation works for somewhat more

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a1b0691a8fcfe39bfab3e87202e484c7
https://doi.org/10.1016/s0020-0190(97)00013-6

Zobrazit plný text záznamu

One-legged caterpillars span hypercubes

Autor: Petr Liebl, Ivan Havel

Publikováno v: Journal of Graph Theory. 10:69-77

The aim of this paper is to prove that any balanced caterpillar having 2n vertices and maximum degree 3 spans the n-dimensional hypercube.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::cc844b606b36ed66a25d8bd60317372f
https://doi.org/10.1002/jgt.3190100110

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání