Incomparability Graphs of Lattices (Q5867210): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The maximal size of the covering graph of a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover-incomparability graphs of posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path length in the covering graph of a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4399900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Triangle Case of the Acquaintance Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3568727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring of lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4639796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 02:20, 30 July 2024

scientific article; zbMATH DE number 7584168
Language Label Description Also known as
English
Incomparability Graphs of Lattices
scientific article; zbMATH DE number 7584168

    Statements

    Incomparability Graphs of Lattices (English)
    0 references
    0 references
    0 references
    13 September 2022
    0 references
    incomparability graph
    0 references
    disconnected graph
    0 references
    tree
    0 references
    bipartite graph
    0 references
    ladder graph
    0 references
    pendant vertex
    0 references

    Identifiers