login
| EN

Cikli in poti v simetričnih grafih / Cycles and paths in symmetric graphs

Naziv

Tittle

Cikli in poti v simetričnih grafih / Cycles and paths in symmetric graphs

Akronim

Acronim

BI-RU/14-15-010

Opis

Description

(SI) Glavni cilji predlaganega projekta so: nadaljnji razvoj metode “drevo lic” za reševanje problema hamiltonskosti, ki se je že izkazala za koristno pri raziskovanju hamiltonskosti kubičnih Cayleyevih grafov, dokazati obstoj hamiltonskih poti v vseh povezanih TT grafih reda manj kot 100. Slednje je posplošitev rezultatov o obstoju hamiltonskih ciklov v povezanih Cayleyevih grafih do reda 100, ki so jih dosegli slovenski člani predlagane projektne skupine v okviru preteklih projektov.
(EN) The main objectives of the proposed project are: to further develop the "tree of faces" method for solving the Hamiltonianity problem, which has already proved useful in the study of Hamiltonianity of cubic Cayley graphs, to prove the existence of Hamiltonian paths in all connected TT graphs of order less than 100. The latter is a generalisation of the results on the existence of Hamiltonian cycles in connected Cayley graphs up to order 100, which have been achieved by the Slovene members of the proposed project group in the framework of previous projects.

Trajanje

Duration

01/01/2014 - 31/12/2015

Vodja projekta

Project Leader

Dragan Marušič

Sodelujoče organizacije

Participating organizations

Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences

Oddelek

Department

Oddelek za matematiko IAM
Univerza na Primorskem

Inštitut Andrej Marušič
UP IAM

Muzejski trg 2
6000 Koper
Slovenija

tel.: +386 (0)5 611 75 91
fax.: +386 (0)5 611 75 92
e-mail: info@iam.upr.si
Avtorske pravice
Izjava o dostopnosti