Return to search

Neki prilozi teoriji turnira / Some contributions to the theory of tournaments

<p>Turniri su najvi&scaron;e istraživana klasa orijentisanih grafova. U tezi su prezentovana dva tipa rezultata. Prvi se odnosi na tzv. neizbežne podgrafove. Obuhvata Hamiltonove bajpase, podgrafove C(<em>n, i</em>) i alternativne Hamiltonove konture. Drugi se bavi problemima frekvencija skorova u običnim, bipartitnim i 3-partitnim turnirima.</p> / <p>Tournaments are the most investigated class of oriented graphs. Two type of results are presented in the thesis. First one is related to so called unavoidable subgraphs. It discusses Hamiltonian bypasses, subgraphs C(n, i) and antidirected Hamiltonian cycles. The second deals with problems of score frequencies in ordinary, bipartite and 3-partite tournaments.</p>

Identiferoai:union.ndltd.org:uns.ac.rs/oai:CRISUNS:(BISIS)5973
Date04 December 1987
CreatorsPetrović Vojislav
ContributorsTošić Ratko, Milić Svetozar, Cvetković Dragoš, Acketa Dragan
PublisherUniverzitet u Novom Sadu, Prirodno-matematički fakultet u Novom Sadu, University of Novi Sad, Faculty of Sciences at Novi Sad
Source SetsUniversity of Novi Sad
LanguageSerbian
Detected LanguageEnglish
TypePhD thesis

Page generated in 0.0021 seconds