\((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) (Q950116): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations) / rank
 
Normal rank
Property / cites work
 
Property / cites work: La relation différence et l'anti‐isomorphie / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal non-\((\leqslant k)\)-reconstructible relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(C_{3}\)-structure of the tournaments. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: L'Indeformabilite des Relations et Multirelations Binaires / rank
 
Normal rank

Latest revision as of 18:52, 28 June 2024

scientific article
Language Label Description Also known as
English
\((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)
scientific article

    Statements