On pairwise compatibility graphs having Dilworth number two (Q2637346): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.12.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000209284 / 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: Threshold characterization of graphs with dilworth number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split graphs of Dilworth number 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring pairwise compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relaxing the Constraints in Pairwise Compatibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dilworth k Graphs and Their Pairwise Compatibility / 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: The Dilworth Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Pairwise compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISCOVERING PAIRWISE COMPATIBILITY GRAPHS / rank
 
Normal rank

Latest revision as of 08:58, 7 July 2024

scientific article
Language Label Description Also known as
English
On pairwise compatibility graphs having Dilworth number two
scientific article

    Statements

    On pairwise compatibility graphs having Dilworth number two (English)
    0 references
    0 references
    0 references
    11 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    pairwise compatibility graphs
    0 references
    Dilworth number
    0 references
    leaf power graphs
    0 references
    minimum leaf power graphs
    0 references
    threshold signed graphs
    0 references
    split permutation graphs
    0 references
    interval graphs
    0 references
    0 references