The \((\leq 6)\)-half-reconstructibility of digraphs (Q404400): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3975132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph reconstruction—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5 / rank
 
Normal rank
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: Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la (-k)-demi-reconstructibilité des tournois finis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prechains and self duality / 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: La dualité dans la demi-reconstruction des relations binaires finies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (<i>n</i> ‐ 1) I / rank
 
Normal rank
Property / cites work
 
Property / cites work: RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (<i>n</i> ‐ 1) II / rank
 
Normal rank

Latest revision as of 00:35, 9 July 2024

scientific article
Language Label Description Also known as
English
The \((\leq 6)\)-half-reconstructibility of digraphs
scientific article

    Statements

    The \((\leq 6)\)-half-reconstructibility of digraphs (English)
    0 references
    0 references
    0 references
    4 September 2014
    0 references
    oriented graphs
    0 references

    Identifiers