On a property of minimal triangulations (Q1024493): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60500846, #quickstatements; #temporary_batch_1710884486334
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and Minimum Fill-in: Grouping the Minimal Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing all potential maximal cliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulations of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On treewidth and minimum fill-in of asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating graphs without asteroidal triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithmic applications of chordal graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank

Latest revision as of 16:49, 1 July 2024

scientific article
Language Label Description Also known as
English
On a property of minimal triangulations
scientific article

    Statements

    On a property of minimal triangulations (English)
    0 references
    0 references
    0 references
    17 June 2009
    0 references
    0 references
    chordal graph
    0 references
    minimal triangulation
    0 references
    chordal triangulation
    0 references
    minimal separator
    0 references
    0 references
    0 references