Please use this identifier to cite or link to this item: https://open.uns.ac.rs/handle/123456789/10804
DC FieldValueLanguage
dc.contributor.authorPetrović, Vojislaven_US
dc.contributor.authorTreml, Miroslaven_US
dc.date.accessioned2020-03-03T14:41:21Z-
dc.date.available2020-03-03T14:41:21Z-
dc.date.issued2002-01-01-
dc.identifier.issn09110119en_US
dc.identifier.urihttps://open.uns.ac.rs/handle/123456789/10804-
dc.description.abstractA claw is a rooted tree whose each branch is a directed path starting at the root. We prove that each rotational tournament on 2n + 1 vertices contains all claws with 2n edges and at most n branches.en
dc.relation.ispartofGraphs and Combinatoricsen
dc.titleClaws in rotational tournamentsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1007/s003730200043-
dc.identifier.scopus2-s2.0-0036972998-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/0036972998-
dc.description.versionUnknownen_US
dc.relation.lastpage596en
dc.relation.firstpage591en
dc.relation.issue3en
dc.relation.volume18en
item.grantfulltextnone-
item.fulltextNo Fulltext-
crisitem.author.deptPrirodno-matematički fakultet, Departman za matematiku i informatiku-
crisitem.author.parentorgPrirodno-matematički fakultet-
Appears in Collections:Naučne i umetničke publikacije
Show simple item record

SCOPUSTM   
Citations

1
checked on May 10, 2024

Page view(s)

11
Last Week
11
Last month
0
checked on May 3, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.