Which \(k\)-trees are cover-incomparability graphs? (Q2440118): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.11.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048927950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover-incomparability graphs and chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover-incomparability graphs of posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cover-incomparability graphs of posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which distance-hereditary graphs are cover-incomparability graphs? / rank
 
Normal rank

Latest revision as of 12:13, 7 July 2024

scientific article
Language Label Description Also known as
English
Which \(k\)-trees are cover-incomparability graphs?
scientific article

    Statements

    Which \(k\)-trees are cover-incomparability graphs? (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2014
    0 references
    poset
    0 references
    cover-incomparability graph
    0 references
    chordal graph
    0 references
    simplicial vertex
    0 references
    \(k\)-tree
    0 references

    Identifiers