Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/10804
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Petrović, Vojislav | en_US |
dc.contributor.author | Treml, Miroslav | en_US |
dc.date.accessioned | 2020-03-03T14:41:21Z | - |
dc.date.available | 2020-03-03T14:41:21Z | - |
dc.date.issued | 2002-01-01 | - |
dc.identifier.issn | 09110119 | en_US |
dc.identifier.uri | https://open.uns.ac.rs/handle/123456789/10804 | - |
dc.description.abstract | A 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.ispartof | Graphs and Combinatorics | en |
dc.title | Claws in rotational tournaments | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.doi | 10.1007/s003730200043 | - |
dc.identifier.scopus | 2-s2.0-0036972998 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/0036972998 | - |
dc.description.version | Unknown | en_US |
dc.relation.lastpage | 596 | en |
dc.relation.firstpage | 591 | en |
dc.relation.issue | 3 | en |
dc.relation.volume | 18 | en |
item.grantfulltext | none | - |
item.fulltext | No Fulltext | - |
crisitem.author.dept | Prirodno-matematički fakultet, Departman za matematiku i informatiku | - |
crisitem.author.parentorg | Prirodno-matematički fakultet | - |
Appears in Collections: | Naučne i umetničke publikacije |
SCOPUSTM
Citations
1
checked on May 10, 2024
Page view(s)
11
Last Week
11
11
Last month
0
0
checked on May 3, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.