Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d (Q2911489): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Sergey V. Savchenko / rank
Normal rank
 
Property / author
 
Property / author: Sergey V. Savchenko / 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.1002/jgt.20615 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1519330495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally semicomplete digraphs: A generalization of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the number of Hamiltonian paths in strong tournaments / 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: Connectivity properties of locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of cycles in local tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subtournaments of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of non-critical vertices in strong tournaments of order \(N\) with minimum out-degree \(\delta ^{+}\) and in-degree \(\delta ^{ - }\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex deletion and cycles in multipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of Hamiltonian cycles in tournaments / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:42, 5 July 2024

scientific article
Language Label Description Also known as
English
Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d
scientific article

    Statements

    Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d (English)
    0 references
    0 references
    31 August 2012
    0 references
    0 references
    circuit
    0 references
    non-critical vertex
    0 references
    tournament
    0 references
    transitive tournament
    0 references
    0 references