On graphs that are not PCGs (Q2512661): 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.2015.01.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2165037031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted directed path graphs are leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact leaf powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterising \((k,\ell )\)-leaf powers / 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: On pairwise compatibility graphs having Dilworth number \(k\) / 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 Relaxing the Constraints in Pairwise Compatibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs That Are Not PCGs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leaf Powers and Their Properties: Using the Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strictly chordal graphs are leaf powers / 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: Triangle-Free Outerplanar 3-Graphs are Pairwise Compatibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISCOVERING PAIRWISE COMPATIBILITY GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise compatibility graphs / rank
 
Normal rank

Latest revision as of 15:26, 9 July 2024

scientific article
Language Label Description Also known as
English
On graphs that are not PCGs
scientific article

    Statements

    On graphs that are not PCGs (English)
    0 references
    0 references
    0 references
    0 references
    30 January 2015
    0 references
    0 references
    pairwise compatibility graph
    0 references
    leaf powers
    0 references
    tree-based distance metric
    0 references
    0 references