Strictly chordal graphs are leaf powers (Q866539): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: W. Sean Kennedy / rank
Normal rank
 
Property / author
 
Property / author: Guo-Hui Lin / rank
Normal rank
 
Property / author
 
Property / author: Gui Ying Yan / rank
Normal rank
 
Property / author
 
Property / author: W. Sean Kennedy / rank
 
Normal rank
Property / author
 
Property / author: Guo-Hui Lin / rank
 
Normal rank
Property / author
 
Property / author: Gui Ying Yan / rank
 
Normal rank
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.jda.2005.06.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049045223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of join dependencies / 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: Algorithms for Square Roots of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing roots of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721973 / 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: Recent Advances in Constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:31, 25 June 2024

scientific article
Language Label Description Also known as
English
Strictly chordal graphs are leaf powers
scientific article

    Statements

    Strictly chordal graphs are leaf powers (English)
    0 references
    14 February 2007
    0 references
    computational biology
    0 references
    phylogeny reconstruction
    0 references
    leaf root
    0 references
    Steiner root
    0 references
    chordal
    0 references
    strictly chordal
    0 references
    0 references
    0 references
    0 references

    Identifiers