On the maximum number of Hamiltonian paths in tournaments (Q2725034): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import recommendations run Q6767936
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1002/rsa.1010 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/rsa.1010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4243451311 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of Hamiltonian paths in tournaments / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/RSA.1010 / rank
 
Normal rank
Property / Recommended article
 
Property / Recommended article: The maximum number of Hamiltonian paths in tournaments / rank
 
Normal rank
Property / Recommended article: The maximum number of Hamiltonian paths in tournaments / qualifier
 
Similarity Score: 0.9909883
Amount0.9909883
Unit1
Property / Recommended article: The maximum number of Hamiltonian paths in tournaments / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3743331 / rank
 
Normal rank
Property / Recommended article: Q3743331 / qualifier
 
Similarity Score: 0.9541714
Amount0.9541714
Unit1
Property / Recommended article: Q3743331 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3218154 / rank
 
Normal rank
Property / Recommended article: Q3218154 / qualifier
 
Similarity Score: 0.9370036
Amount0.9370036
Unit1
Property / Recommended article: Q3218154 / qualifier
 
Property / Recommended article
 
Property / Recommended article: About the number of oriented Hamiltonian paths and cycles in tournaments / rank
 
Normal rank
Property / Recommended article: About the number of oriented Hamiltonian paths and cycles in tournaments / qualifier
 
Similarity Score: 0.93567646
Amount0.93567646
Unit1
Property / Recommended article: About the number of oriented Hamiltonian paths and cycles in tournaments / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q3680863 / rank
 
Normal rank
Property / Recommended article: Q3680863 / qualifier
 
Similarity Score: 0.9339976
Amount0.9339976
Unit1
Property / Recommended article: Q3680863 / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4519727 / rank
 
Normal rank
Property / Recommended article: Q4519727 / qualifier
 
Similarity Score: 0.9339976
Amount0.9339976
Unit1
Property / Recommended article: Q4519727 / qualifier
 
Property / Recommended article
 
Property / Recommended article: On the Number of Hamiltonian Cycles in a Tournament / rank
 
Normal rank
Property / Recommended article: On the Number of Hamiltonian Cycles in a Tournament / qualifier
 
Similarity Score: 0.9334197
Amount0.9334197
Unit1
Property / Recommended article: On the Number of Hamiltonian Cycles in a Tournament / qualifier
 
Property / Recommended article
 
Property / Recommended article: A note on the number of Hamiltonian paths in strong tournaments / rank
 
Normal rank
Property / Recommended article: A note on the number of Hamiltonian paths in strong tournaments / qualifier
 
Similarity Score: 0.9321503
Amount0.9321503
Unit1
Property / Recommended article: A note on the number of Hamiltonian paths in strong tournaments / qualifier
 
Property / Recommended article
 
Property / Recommended article: Q4527627 / rank
 
Normal rank
Property / Recommended article: Q4527627 / qualifier
 
Similarity Score: 0.9194136
Amount0.9194136
Unit1
Property / Recommended article: Q4527627 / qualifier
 

Latest revision as of 19:21, 4 April 2025

scientific article
Language Label Description Also known as
English
On the maximum number of Hamiltonian paths in tournaments
scientific article

    Statements

    On the maximum number of Hamiltonian paths in tournaments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2002
    0 references
    tournament
    0 references
    Hamiltonian paths
    0 references
    bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references