Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4583735 / rank
 
Normal rank
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: Q4583890 / 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: Q3558635 / 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: Isomorphy and dilatation in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypomorphy of graphs up to complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean sum of graphs and reconstruction up to complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Finite T<sub>0</sub> + T<sub>5</sub> Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitivity is hereditary for 2-structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4492680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2828847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstruction of posets with the same comparability graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: L'Indeformabilite des Relations et Multirelations Binaires / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphy up to complementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(P_ 4\)-trees and substitution decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259049 / rank
 
Normal rank

Latest revision as of 11:35, 22 July 2024

scientific article
Language Label Description Also known as
English
Finite orders which are reconstructible up to duality by their comparability graphs
scientific article

    Statements

    Finite orders which are reconstructible up to duality by their comparability graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 April 2020
    0 references
    ordered set
    0 references
    comparability graph
    0 references
    reconstruction
    0 references
    isomorphism up to duality
    0 references
    modular decomposition
    0 references

    Identifiers