Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2008.05.019 / 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.dam.2008.05.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2172298723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge and vertex intersection of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2717917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tolerance intersection graphs on binary trees with constant tolerance 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant tolerance intersection graphs of subtrees of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity threshold for random chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2008.05.019 / rank
 
Normal rank

Latest revision as of 12:22, 10 December 2024

scientific article
Language Label Description Also known as
English
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references