A characterization of unique tournaments (Q1386429): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q656146
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: John W. Moon / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jctb.1997.1799 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082549494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournaments That Admit Exactly One Hamiltonian Circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating tournaments that admit exactly one Hamiltonian circuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Either tournaments or algebras? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872493 / rank
 
Normal rank

Latest revision as of 11:35, 28 May 2024

scientific article
Language Label Description Also known as
English
A characterization of unique tournaments
scientific article

    Statements

    A characterization of unique tournaments (English)
    0 references
    0 references
    26 November 1998
    0 references
    The author uses results of \textit{V. Müller}, \textit{J. Nešetřil} and \textit{J. Pelant} [Discrete Math. 11, 37-66 (1975; Zbl 0301.05114)] to deduce that there are exactly four strong tournaments that are determined up to isomorphism by their score sequences. Reviewer's remark: A direct proof of this result was given by \textit{P. Avery} [J. Graph Theory 4, 157-164 (1980; Zbl 0403.05045)].
    0 references
    tournaments
    0 references
    score sequences
    0 references
    0 references

    Identifiers