Kings in quasi-transitive digraphs (Q1584249): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex heaviest paths and cycles in quasi-transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3346349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The radii of n-partite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toppling kings in a tournament by introducing new kings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kings in \(k\)-partite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every vertex a king / rank
 
Normal rank

Revision as of 17:04, 30 May 2024

scientific article
Language Label Description Also known as
English
Kings in quasi-transitive digraphs
scientific article

    Statements

    Kings in quasi-transitive digraphs (English)
    0 references
    0 references
    0 references
    2 November 2000
    0 references
    0 references
    king
    0 references
    quasi-transitive digraph
    0 references