On pairwise compatibility graphs having Dilworth number \(k\) (Q2253200): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph classes with structured neighborhoods and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold characterization of graphs with dilworth number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ptolemaic Graphs and Interval Graphs Are Leaf Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring pairwise compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On pairwise compatibility graphs having Dilworth number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE PAIRWISE COMPATIBILITY PROPERTY OF SOME SUPERCLASSES OF THRESHOLD GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs That Are Not PCGs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition algorithms for orders of small width and graphs of small Dilworth number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dilworth Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on perfect orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graph Powers for Leaf-Labeled Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectness and Dilworth number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISCOVERING PAIRWISE COMPATIBILITY GRAPHS / rank
 
Normal rank

Latest revision as of 18:50, 8 July 2024

scientific article
Language Label Description Also known as
English
On pairwise compatibility graphs having Dilworth number \(k\)
scientific article

    Statements

    On pairwise compatibility graphs having Dilworth number \(k\) (English)
    0 references
    0 references
    0 references
    25 July 2014
    0 references
    Dilworth number
    0 references
    leaf power graphs
    0 references
    minimum leaf power graphs
    0 references
    pairwise compatibility graphs
    0 references

    Identifiers